Question

plz provide me the technic of sorting​

Answer 1

To get the amount of time required to sort an array of 'n' elements by a particular method, the normal approach is to analyze the method to find the number of comparisons (or exchanges) required by it. Most of the sorting techniques are data sensitive, and so the metrics for them depends on the order in which they appear in an input array.

Various sorting techniques are analyzed in various cases and named these cases as follows:

Best case

Worst case

Average case

Hence, the result of these cases is often a formula giving the average time required for a particular sort of size 'n.' Most of the sort methods have time requirements that range from O(nlog n) to O(n2).

Bubble Sort

Selection Sort

Merge Sort

Insertion Sort

Quick Sort

Heap Sort

Hope it helps you

Answer 2

Explanation:

this is the technic of sorting by Nazish sir