Quick Sort
Quick Sort is a fast, divide-and-conquer algorithm that selects a pivot element and partitions the array into two sub-arrays—elements less than the pivot and elements greater than it. The sub-arrays are sorted recursively, resulting in an average-case time complexity of O(n log n), making it efficient for large datasets.
20-October-2024
Merge Sort
Merge Sort is a stable, divide-and-conquer algorithm that divides the list into sub-lists, each containing one element, and then merges them back together in sorted order. It has a time complexity of O(n log n) and is efficient for large datasets, although it requires additional memory for merging.
20-October-2024
Selection sort
Selection Sort is a simple algorithm that divides the list into a sorted and an unsorted section. It repeatedly selects the smallest element from the unsorted section and swaps it with the leftmost unsorted element. With a time complexity of O(n²), it is not efficient for large datasets compared to more advanced algorithms.
20-October-2024
Bubble Sort
Bubble Sort is a straightforward algorithm that repeatedly compares adjacent elements in a list and swaps them if they are in the wrong order. This process continues until the list is sorted. Although easy to implement, it is inefficient for large datasets, with a worst-case time complexity of O(n²).
20-October-2024