What is Bubble sorting?
A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
1. Large values sorted first
2. A very important concept of algorithm
3. Best time Complexity is O(n)
4. Average and Worst time complexity is O(n²)
Click to launch Bubble sorting
What is Insertion Sorting?
A simple sorting algorithm that builds the final sorted array one item at a time.
1.Efficient for smaller datasets
2. Effective for partially sorted array
3. Best time Complexity is O(n)
4. Average and Worst time complexity is O(n²)
Click to launch Insertion sorting