Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Ruan XiangNing
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Answers by Ruan XiangNing
0
votes
Time Complexity 0.25 * n and k +=k
answered
May 2, 2019
in
Asymptotic Analysis
time-complexity
nested-loops
loops
0
votes
If you are happy and you know it, jump up high!
answered
May 2, 2019
in
Dynamic Programming
dynamic-programming
0
votes
The Subarray with the Minimum Peak
answered
May 2, 2019
in
Divide & Conquer
peak
min-max
0
votes
Around the block party planning
answered
May 1, 2019
in
Dynamic Programming
0
votes
What's the time complexity for solving Sudoku with backtrack method?
answered
May 1, 2019
in
NP-Completeness
time-complexity
backtracking
sudoku
0
votes
The executive time of program in eclipse seems to be randomly when the times are not very large
answered
May 1, 2019
in
Asymptotic Analysis
0
votes
Sum of the Arithmetico-Geometric Progression (AGP)
answered
May 1, 2019
in
Math Basics
math
series
0
votes
Finding non-leaf node of a tree with no large subtrees
answered
May 1, 2019
in
Backtracking/DFS/BFS
tree
graph
subtree
0
votes
Maximum Value Contiguous Subregion
answered
May 1, 2019
in
Dynamic Programming
mvcs
dynamic-programming
0
votes
Three Set Sum: Given an integer k and 3 sets A, B and C, find a, b, c such that a + b + c = k
answered
May 1, 2019
in
Divide & Conquer
sorted-lists
searching
0
votes
The lower bound for the Traveling Salesman Problem
answered
May 1, 2019
in
Branch & Bound
branchandbound
0
votes
How to find the "joint" median of 3 sorted lists, in less than linear time?
answered
May 1, 2019
in
Divide & Conquer
median
sorted-lists
0
votes
Cost Minimizing Ice Cream Shop
answered
May 1, 2019
in
Dynamic Programming
0
votes
“Teleportation” across astro-haunted galaxies
answered
May 1, 2019
in
Dynamic Programming
dynamic-programming
0
votes
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
answered
May 1, 2019
in
Asymptotic Analysis
recurrence-relations
asymptotic-analysis
time-complexity
0
votes
Rectangles overlap
answered
May 1, 2019
in
Divide & Conquer
+1
vote
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
answered
May 1, 2019
in
Asymptotic Analysis
time-complexity
loops
0
votes
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
answered
May 1, 2019
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
0
votes
Symbol Frequency
answered
Apr 30, 2019
in
Greedy Algorithms
greedy
0
votes
8 puzzle that can be solved or not?
answered
Apr 30, 2019
in
Informed Search
n-puzzle
Page:
1
2
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc