Question

एक आयामी ऐसे में किसी तत्व की स्थिति की गणना के लिए सूत्र लिखिए।

Answer 1

Answer:

As another example, many sorting algorithms rearrange arrays into sorted order in-place, including: bubble sort, comb sort, selection sort, insertion sort, heapsort, and Shell sort. These algorithms require only a few pointers, so their space complexity is O(log n). Quicksort operates in-place on the data to be sorted.. Hope it helps you.....why increase 6 is synthesized