Does anyone else have the same problem? My code returns 0-6-0-3-4-7-4-3-0-5-8-0-3-4-1, instead of 0-6-0-3-4-7-4-3-0-6-8-0-3-4-1. But this is because Dijkstra's algorithm would pick the smaller edge, 0-5 instead of 0-6. However, 0-6-8 results in a to...

For lab 6 test case, it would be helpful if anyone has already solved the path from 0 to 1 with time 39 to post the route being taken.

With the standard Dijkstra algorithm, we can imeplement the checks so that the edges are limited when solving the shortest distance. This occurs becuase the clearance is not being satisfied. But how can we still consider the possible path should the t...

Since there is no such input size where merge sort is faster than insertion sort, then based on the general time complexity of the sorting algorithms, merge sort will be the obvious solution. Is this correct? Based on the standard competition ranking,...

Amitava mentioned in the lecture that insertion sort is faster than merge sort up until 6000 elements. However, the graph of both algorithms show that the intercept is much smaller, and insertion sort is only faster for less than 100 elements approxi...

I am unsure how the rank system works. If 10,20,20,40, then the ranks are 1,2,2,4. However, what if a get rank time(3) is provided, but there are no rank3? If get rank time(3) returns '20', then it the rank is simply the index - 1 which seems wrong.