The way a card game player arranges his cards as he picks them up one by one, is an example of
You want to check whether a given set of items is sorted. Which of the following sorting methods will be the most efficient if it is already is sorted order?
1 Crore+ students have signed up on EduRev. Have you? Download the App 
Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficiency?
You are asked to sort 15 randomly generated numbers. You should prefer
As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be
Which of the following algorithms exhibits the unnatural behaviour that, minimum number of comparisons are needed if the list to be sorted is in the reverse order and maximum number of comparisons are needed if they are already in sorted order?
Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?
Which of the following algorithm design technique is used in the quick sort algorithm?
A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output?
Which of the following also called "diminishing interment sort"?
55 docs215 tests

55 docs215 tests
