Computer Science, asked by harshrathee2307, 2 months ago

which sorting algorithm is better to use if the data elements keep driving during the sort ?​

Answers

Answered by gursharanjali
0

Answer:

this is the correct answer for the question

Attachments:
Answered by pankajpandeyakriti
1

Answer:

Quicksort

Quicksort. Quicksort is one of the most efficient sorting algorithms, and this makes of it one of the most used as well. The first thing to do is to select a pivot number, this number will separate the data, on its left are the numbers smaller than it and the greater numbers on the right.

Similar questions