No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
If I have an array of entries 5, 10, and 20. How many heaps are there for each? Since there are two sorting algorithms, bottom-up and top-down, Are there 2 heaps for each entries? Help me guys :D 
|
|
|
Hello guys. I'm stuck at my algorithm assignment. Here is the problem. We found that the solution to the mergesort recurrence f(n) = f(┏n/2┓) + f(└n/2┘) + n, f(1) = 0 satisfied f(n) = Θ(nlogn). Find an expression for the exact value of f(n). (Hint: generate the first 20 to … 
|
|
|
Hello guys, I'm struggling at my assignmnet. I need your help. for(int i=1; i<N; i++) for(int j=1; j<N; j++) for(int k=1; k <= i*j*log(j); k*=2) x=i+j+k; Calculate runtimes using these inputs N = 10, 20, 40, 100, 200, 400, 1000, 2000, 4000, 10000, based on the results, conjecture the complexity …
|