Insertion sort vs Bubble Sort Algorithms

Question

I\'m trying to understand a few sorting algorithms, but I\'m struggling to see the difference in the bubble sort and insertion sort algorithm.

I know both are O(n

Answer 1

insertion sort:

1.In the insertion sort swapping is not required.

2.the time complexity of insertion sort is Ω(n)for best case and O(n^2) worst case.

3.less complex as compared to bubble sort.

4.example: insert books in library, arrange cards.

bubble sort: 1.Swapping required in bubble sort.

2.the time complexity of bubble sort is Ω(n)for best case and O(n^2) worst case.

3.more complex as compared to insertion sort.