Odd-Even Sort Multiple choice Questions and Answers (MCQs)
Odd-even sort is also known as .....
Question 1 Explanation:
Odd-even sort is also known by the name of a brick sort. This algorithm was first proposed by Habermann in 1972 and was initially invented for parallel computation of local interconnection.
Odd-even sort is a variation of .....
Question 2 Explanation:
Odd-even sort is very similar to bubble sort. It works by applying bubble sort in two phases I.e odd phase and even phase. In odd phase bubble sort is applied on odd indexed elements and in even phase bubble sort is applied on even indexed elements.
Auxiliary space requirement of odd-even sort is .....
Question 3 Explanation:
In odd-even sort manipulation is done on the input array itself. So no extra space is required to perform sorting. Thus it requires constant auxiliary space.
Which of the following sorting algorithm is NOT stable?
Question 4 Explanation:
Out of the given options quick sort is the only algorithm which is not stable. Brick sort like bubble sort is a stable sorting algorithm.
Which of the following sorting algorithm is in place?
Question 5 Explanation:
Brick sort is an in place sorting technique as it only requires constant auxiliary space for manipulating the input array.
There are 5 questions to complete.