Sorting is not possible by using which of the following methods?
(a) Insertion (b) Selection (c) Exchange (d) Deletion
- 1 Answers
- 1248 Views
- I also Faced
- E-Mail Answers
Answer / rohit sah
Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.
| Is This Answer Correct ? | 0 Yes | 0 No |
What do you mean by union-by-weight?
What is mergesort and hashtable?
Can treeset contain null?
What is the two-dimensional array?
Is vector synchronized?
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.
What are the types of bulleted list?
Is complete binary tree?
What do you mean by hash function?
What is a b+ tree? Explain its uses.
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
Which is faster arraylist or hashmap?
Windows 
