Which of the following is the best-case time complexity of Floyd's algorithm for finding shortest paths in a graph with 'n' vertices?
Show answerHide answer
Correct answer: (D) Θ(n³)
From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)
This is question 178 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.