/docs/notes/development/algo/sorting/ Recent content in Sorting on Piotr Kosmowski Hugo -- gohugo.io pl-pl /docs/notes/development/algo/sorting/bublesort/ Mon, 01 Jan 0001 00:00:00 +0000 /docs/notes/development/algo/sorting/bublesort/ Bubble Sort is a simple comparison-based sorting algorithm. It repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The process is repeated until no swaps are needed, indicating that the list is sorted. It is named “bubble sort” because smaller elements “bubble” to the top of the list (beginning of the array), while larger elements sink to the bottom (end of the array) during the sorting process. /docs/notes/development/algo/sorting/mergesort/ Mon, 01 Jan 0001 00:00:00 +0000 /docs/notes/development/algo/sorting/mergesort/ Merge Sort is a divide-and-conquer algorithm used for sorting. It works by dividing the array into smaller subarrays, sorting those subarrays recursively, and then merging them back together. The key characteristic of Merge Sort is that it guarantees O(n log n) time complexity in all cases (best, average, and worst), making it efficient even for large datasets. Method # Divide: Split the array into two halves until you have subarrays of size 1. /docs/notes/development/algo/sorting/quicksort/ Mon, 01 Jan 0001 00:00:00 +0000 /docs/notes/development/algo/sorting/quicksort/ QuickSort is a highly efficient divide-and-conquer algorithm used for sorting. It picks a pivot element from the array and partitions the other elements into two sub-arrays: those smaller than the pivot and those greater than the pivot. The process is recursively repeated for the sub-arrays, and the result is a sorted array. Method # Choose a Pivot: Select an element from the array (usually the first, last, or middle element, or a random element).