Bubble Sort

The Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

Learn more about Bubble Sort

Quick Sort

Quick Sort is a highly efficient sorting algorithm and is based on partitioning an array into smaller sub-arrays. A pivot element is selected from the array and the array is partitioned into two parts - one with elements less than the pivot and the other with elements greater than the pivot.

Learn more about Quick Sort

Merge Sort

Merge Sort is an efficient, stable, comparison-based, divide and conquer sorting algorithm. Most implementations produce a stable sort, which means that the implementation retains the input order of equal elements in the sorted output.

Learn more about Merge Sort

Check out our Froge Lovers Community!

Join our community of learners who love froges and algorithms! Share your knowledge, ask questions, and learn together.

Join the Froge Community