Elitmus
Exam
Programming
Definition
In the sorting the list is traverse and the first element replace by the any small element in the list. What is the name of this sorting technique.
1 insertion sort
2 selection sort
3 quick sort
4 heap sort
Read Solution (Total 13)
-
- selection sort is the answer
- 10 years agoHelpfull: Yes(14) No(0)
- selection sort
- 10 years agoHelpfull: Yes(4) No(0)
- In selection sort first element replace by the small element
- 9 years agoHelpfull: Yes(3) No(0)
- selection sort
- 10 years agoHelpfull: Yes(2) No(1)
- Insertion Sort
- 9 years agoHelpfull: Yes(2) No(0)
- selection sort
- 9 years agoHelpfull: Yes(1) No(1)
- selection sort
- 9 years agoHelpfull: Yes(1) No(1)
- selection sort
- 9 years agoHelpfull: Yes(1) No(0)
- selection sort
- 9 years agoHelpfull: Yes(0) No(1)
- quick sort . i think so.
- 8 years agoHelpfull: Yes(0) No(1)
- selection sort
- 8 years agoHelpfull: Yes(0) No(1)
- Selection sort
- 8 years agoHelpfull: Yes(0) No(1)
- 100% quick sort
- 8 years agoHelpfull: Yes(0) No(1)
Elitmus Other Question