1.Sort strategy with some example
2. Merge strategy With some example
1. Sort strategy:
Sorting is the process of arranging elements in a specific order. There are various sorting algorithms, each with its own advantages and disadvantages. Here are two commonly used sort strategies:
a) Bubble Sort:
Bubble sort works by repeatedly swapping adjacent elements if they are in the wrong order. It continues this process until the entire list is sorted. Here's an example:
Input: [5, 2, 9, 1, 6]
Step 1: [2, 5, 9, 1, 6] (swapped 5 and 2)
Step 2: [2, 5, 1, 9, 6] (swapped 9 and 1)
Step 3: [2, 5, 1, 6, 9] (swapped 9 and 6)
Step 4: [2, 1, 5, 6, 9] (swapped 5 and 1)
Step 5: [1, 2, 5, 6, 9] (swapped 2 and 1)
Output: [1, 2, 5, 6, 9]
b) Quick Sort:
Quick sort is a Divide and Conquer algorithm that selects an element as a pivot and partitions the array around the pivot such that elements on the left are smaller, and on the right are larger. It then recursively applies this process to the sub-arrays. Here's an example:
Input: [5, 2, 9, 1, 6]
Step 1: [1, 2, 5, 9, 6] (pivot = 5, partitioned)
Step 2: [1, 2, 5] + [9, 6] (partitioned sub-arrays)
Step 3: [1] + [2] + [5] + [6, 9] (partitioned sub-arrays)
Step 4: [1, 2] + [5] + [6, 9] (partitioned sub-arrays)
Step 5: [1, 2, 5] + [6, 9] (sorted sub-arrays)
Output: [1, 2, 5, 6, 9]
2. Merge strategy:
Merging is the process of combining two or more sorted arrays into a single sorted array. Here's an example of the merge strategy:
Input: Array1 = [1, 3, 6, 9], Array2 = [2, 4, 7, 8]
Step 1: [1, 2, 3, 6, 7, 8, 9] (merged)
Output: [1, 2, 3, 6, 7, 8, 9]
In this example, both Array1 and Array2 are already sorted. The merge strategy works by comparing the elements from both arrays and placing them in the correct order in the merged array.
The merge strategy is commonly used in sorting algorithms like Merge Sort, where the algorithm recursively divides the array into smaller sub-arrays, sorts them, and then merges them back together until the entire array is sorted.