Bubble sort: This is a simple sorting algorithm to sort the elements in ascending order or descending order. This algorithm makes the several passes through the elements of the array and the smallest elements are “bubble up” to the top of the array. On each pass, the larger elements are “bubbled” towards the end of the array. After all the passes are completed, the elements are arranged from smallest to biggest in order. Insertion sort: This is a sorting algorithm in which the first two elements of the array are taken and these elements are compared. If the swap is required, then it swaps the elements and places the elements in proper order. Now, this becomes a sorted portion of an array. Then it starts with the third element of the array and it is compared with the already sorted portion. This is done to insert the elements relatively in correct position according to first two elements. If the swap is required on comparison, then it is need to shift the elements until the third elements is placed in it correct position. Now, the first three elements will be in sorted manner. This process is continued for the fourth and subsequent elements until all of the elements are inserted into proper positions.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 6SA

Program Plan Intro

Bubble sort:

This is a simple sorting algorithm to sort the elements in ascending order or descending order.

This algorithm makes the several passes through the elements of the array and the smallest elements are “bubble up” to the top of the array.

On each pass, the larger elements are “bubbled” towards the end of the array.

After all the passes are completed, the elements are arranged from smallest to biggest in order.

Insertion sort:

This is a sorting algorithm in which the first two elements of the array are taken and these elements are compared. If the swap is required, then it swaps the elements and places the elements in proper order.

Now, this becomes a sorted portion of an array. Then it starts with the third element of the array and it is compared with the already sorted portion.

This is done to insert the elements relatively in correct position according to first two elements.

If the swap is required on comparison, then it is need to shift the elements until the third elements is placed in it correct position.

Now, the first three elements will be in sorted manner.

This process is continued for the fourth and subsequent elements until all of the elements are inserted into proper positions.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

What does the value of the top variable indicate in this ArrayStack implementation? What will happen if we call pop on this stack? What value will be returned, and what changes will occur in the array and the top variable? 3. If we push the value "echo" onto the stack, where will it be stored in the array, and what will be the new value of top? 4. Explain why index 0 contains the string "alpha" even though top is currently 3. 5. What would the state of the stack look like (values in the array and value of top) after two consecutive pop 0 operations?

Please solve and show all work. Suppose there are four routers between a source and a destination hosts. Ignoring fragmentation, an IP datagram sent from source to destination will travel over how many interfaces? How many forwarding tables will be indexed to move the datagram from the source to the destination?

Please solve and show all work. When a large datagram is fragmented into multiple smaller datagrams, where are these smaller datagrams reassembled into a single large datagram?