Question 22 The time required to find shortest path in a graph with n vertices and e edges is : A O(e) B O(n) C O(e2) […]

Question 2 A sorting technique is called stable if A it takes O (nlog n) time B it maintains the relative order of occurrence of non-distinct […]

Question 97 Selection sort algorithm design technique is an example of A Greedy method B Divide-and-conquer C Dynamic Programming D Backtracking AlgorithmsSortingISRO-2007 Question 97 Explanation:  The […]

Question 101 Which of the following sorting algorithms uses recursion? A Insertion sort B Heap sort C Merge sort D Bubble sort AlgorithmsSortingKVS DEC-2017 Question 101 […]