Question: Because it swaps items only when they are strictly out of order, bubble sort is an example of a ( n ) sorting algorithm. stable

Because it swaps items only when they are strictly out of order, bubble sort is an example of a(n) sorting algorithm.
stable
unstable
recursive
in-place
Because it swaps items only when they are

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!