edited by
1,065 views
1 votes
1 votes

 

Which sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanges it with the preceding value until it is in its correct place?

  1. Insertion sort
  2. Internal sort
  3. External sort
  4. Radix sort
edited by

1 Answer

1 votes
1 votes
in INSERTION SORT, We take one element and checking the correct position of it, in partially sorted array by repeatedly interchanging it with the preceding value.
Answer:

Related questions

3 votes
3 votes
4 answers
1
2 votes
2 votes
2 answers
2
gatecse asked Dec 9, 2020
730 views
Number of letter repeated in the given word $’MEASUREMENTS’$ are indicated in front of each alternative. Identify the correct alternative.$M_2E_2A_2S_2U_1R_1N_1T_1$$M...
2 votes
2 votes
1 answer
3
gatecse asked Dec 9, 2020
713 views
If $09/12/2001(DD/MM/YYYY)$ happens to be Sunday, then $09/12/1971$ would have been a:WednesdayTuesdaySaturdayThursday
2 votes
2 votes
2 answers
4
gatecse asked Dec 9, 2020
778 views
If a cube with length, height and width equal to $10\; cm$, is reduced to a smaller cube of height, length and width of $9\; cm$ then reduction in volume is :$172\;cm^3$$...