File sorting techniques

The next element. Recommended Articles. Find whether it is possible to make array elements same using one external number Set 2. Article Contributed By :. Easy Normal Medium Hard Expert.

Writing code in comment? Please use ide. Load Comments. What's New. First, we will go with Bubble sort. Bubble sort is one of the simplest sort methods we can use it for applications. In this technique, successive swaps are made through the records to be sorted.

At each step, it compares the key to the data and exchanges the elements if not in the desired order. Sorting is done with the adjacent elements at the time only one element is placed in the sorted place after a swap. Similarly, all the steps take the same until the array becomes sorted. Step 2: 6 is compared with 4.

As 6 is greater than 4. Therefore, 6 and 4 are swapped. Step 3: Element 6 is compared with 7. In this technique, we start with the second data element by assuming the first element is already sorted, and comparison is done with the second element, and the step is continued with the other subsequent element.

It is necessary to have N-1 passes in an array of N elements to have a sorted element. Step 1: The first element looks for the largest element in the array to swap. If it is larger, it remains the same and gets moved on to the second element; here, 8 is greater than all, no swap is made.

This technique follows the divide and conquers algorithm and is considered very efficient and quicker for huge arrays. JavaScript Tutorials jQuery Tutorials. Sorting Techniques. Table of Contents. What is sorting? Categories of Sorting. The Complexity of Sorting Algorithms. The Efficiency of Sorting Techniques. Save Article. Like Article. Previous Different types of recurrence relations and their solutions. Next Converting one string to other using append and delete last operations. Recommended Articles.

Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide. Load Comments.