Question

11. Which of the following sorting algorithm is the slowest?
(A) Bubble sort
(B) Heap sort
(C) Shell sort
(D) Quick sort

Answer 1

The correct option is b Bubble sort.

• The bubble filter is a filter algorithm that compares two adjacent elements and then rotates them until they are not in the intended sequence.
• As the movement of air bubbles in the water rises to the surface, each part of the same organism eventually goes to each repetition. Therefore, it is called a bubble type.
• The only significant advantage is that the type of bubble that has more than most other algorithms, even the fastest, but not the type of input, is that the ability to see that the list is well sorted is built into the algorithm. When the list is already filtered (preferably), the complexity of the filter blur is {\ display style O (n)} O (n) only {\ display style O (n)} O (n). In contrast, most other algorithms, even those with a better average complexity, perform their entire filtering process in a set and thus more complex.

Answer 2

Which of the following sorting algorithm is the slowest?

(A) Bubble sort

(B) Heap sort

(C) Shell sort

(D) Quick sort

The correct answer :

(A) Bubble sort

Explanation :

Bubble sort is the slowest sorting algorithm. It is also one of the easiest sorting algorithms to understand and code from scratch.

Bubble sort makes repeated comparisons and swaps adjacent elements in each pass if necessary. In the i-th pass of bubble sort, the last (i-1) elements are already sorted, and the i-th largest element is placed at the (N-i)-th position, i.e. at the i-th last position. is kept. So bubble sort is the slowest sorting algorithm.

#SPJ2

Learn more :

https://brainly.in/question/2644503

The basic web services platform is the combination of ____and____?

https://brainly.in/question/38116286

HTML is made up of ____ and ____ that tells the document how to display page.