Bubble Sort is a _______________.simple non-comparison sorting algorithmcomplex comparison sorting algorithmsimple non-comparison searching algorithmsimple comparison sorting algorithm

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. The problem with bubble sort is its worst case scenario. When the smallest element is in the last position, then it takes more time to sort in ascending order, but takes less time to sort in descending order.An array is called beautiful if all the elements of the array are in either ascending or descending order. Given an array of numbers, find the minimum swap operations required to make the array beautiful.

Write a description of bubble sort in programming, give the steps to follow, keep it short

Optimized bubble sort algorithm

Which of the following is a Divide and Conquer algorithm?Bubble SortSelection SortHeap SortMerge Sort

The complexity of Bubble sort is ans. O(n3) O(n log n) O(n) O(log n)