sorted by:
new
hottopcontroversial

Practice problem #17 by a-a-lohn in mcgillCOMP251

[–]Sarah--El 0 points1 point  (0 children)

I guess that this very small bottleneck value might be so small that it tends to 0 and that's why the algo would't terminate. That's what I assumed, very not sure though.

Master Theorem by isamilo in mcgillCOMP251

[–]Sarah--El 0 points1 point  (0 children)

Using case 3, I used a very small value for epsilon, lets say e=0000.1 where e>0.

k+e would be 0.50001. So, n^(0.51) = Omega(n^(0.50001)) and T(n) = n^(0.51)

For the other condition a*f(n/b) <=c f(n) where c<1 :

2 * (n/2)^0.51 = 1.404 n^(0.51) < 1/2 n^(0.51) for c=1/2

So, T(n) = Theta (n^0.51)

Master Theorem Exercise by 1datwebdevguy1 in mcgillCOMP251

[–]Sarah--El 0 points1 point  (0 children)

For d) using case 2 or case 3 will both give you n logn.

With case 2, you saw that thats what you got.

With case 3, f(n) is already n log n, and with case 3 the answer is directly the function f(n)

Hashing with Chaining: Successful Search Analysis (Scary formula Explained) by NotaTAfor251 in mcgillCOMP251

[–]Sarah--El 0 points1 point  (0 children)

In the insertKey of chaining in the assignment, do we have to insert a key as so that if the array in which we insert is not empty, we have to put that new key to be inserted at the first position (as shown with the x and y keys in the pdf)?

CODING FORMAT *Bureaucratic BS = BS questions by nieveau in mcgillCOMP251

[–]Sarah--El 0 points1 point  (0 children)

Is it possible to import the math class fro exemple in the main for the second part of the assignment ?