What is the time complexity to implement Dijkstra’s algorithm using a sorted array instead of heap for a Priority Queue?
for sorted array
let V be the number of nodes and E be the number of edges
1)extract min operation ---it will take constant time and it is repeated for V nodes.hence takes O(v) time.
2)decrease key operation occurs E times------now we can directly go and decrease the value of the node but we might have to sort the array again because after decreasing the key,array might not be sorted..so it will take VlogV time if we use merge sort.so ,total time is E*VLOGV
please verify this.