Miscellaneous on Data Structure and Algorithms related Questions and Answers

Question :   Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges) 1. O(V + E) 2. O(V) 3. O(E) 4. None of the mentioned Answer :   1 - O(V + E)