Worst case of bubble sort algorithm is nothing but _______.
a) Inverse sorting b) Direct sorting c) Both a and b d) None of these
Running time for both best case and worst case of bubble sort algorithm are _____.
a) Different b) Same c) May be same d) None of these
Bubble sort is also called as ________.
a) Comparison sort b) Direct sort c) Insertion sort d) None of these
Running time of bubble sort algorithm is _____.
a) O(n) b) O(n2) c) O(3n) d) None of these.
Bubble sort follows which method?
a) Exchanging method b) Direct method c) Both a and b d) None of these
The best, average and worst case time complexities of the selection sort.
a) O(n2) b) O(n) c) O(2n) d) None of these.
Selection sort ______ smallest element with the value in the first position.
a) Unswap b) Swaps c) Search d) Rotation
_______ finds the minimum.
a) Selection sort b) Insertion sort c) Both a and b d) None of these.
In selection sort scan the array to find its ____ and swap it with the first element.
a) Largest element b) Smallest element c) Both a and b d) None of these.
Brute force is a ______.
a) Straight forward approach b) Straight backward approach c) Both a and b d) None of these
Which of the following sorting algorithm is of divide and conquer type?
a) Bubble sort b) Insertion sort c) Quick sort d) Merge sort
Very slow way of sorting is ______.
a) Insertion sort b) Heap sort c) Bubble sort d) Quick sort
Insert elements in a priority queue implemented with sorted sequence is done in ____.
a) Insertion sort b) Selection sort c) Quick sort d) None of these.
Insert elements in a priority queue implemented with an unsorted sequence is done in ____.
a) Insertion sort b) Selection sort c) Quick sort d) None of these
Based on which concept priority queue is done?
a) Priority b) Queue c) Stack d) None of these.
The worst time complexity for insertion sorting is _______.
a) O(n2) b) O(n) c) O(n3) d) None of these.