If you have array_size 'n' and the integer range less than n^100 then can you sort them in linear time? for example n=15; [100,8000,900,1,9000,6666,7444,23,2687,10101,465,535,15,1565,1789,89]?
Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix.
What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?
Say we only know the worst case and best case complexity of an algo (Algo is not known). Is it possible to get the average case complexity?