Insertion sort:

This is 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.

Example:

Consider the elements to sort (3, 6, 5, 2, 1, 4).

The number 3 is less than 6; so no changes are made; next number 6 is greater than 5. So, number 5 is inserted in between 3 and 6.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 17.1, Problem 17.1CP

Chapter 17.1, Problem 17.3CP

Students have asked these similar questions

We are considering the RSA encryption scheme. The involved numbers are small, so the communication is insecure. Alice's public key (n,public_key) is (247,7). A code breaker manages to factories 247 = 13 x 19 Determine Alice's secret key. To solve the problem, you need not use the extended Euclid algorithm, but you may assume that her private key is one of the following numbers 31,35,55,59,77,89.

Consider the following Turing Machine (TM). Does the TM halt if it begins on the empty tape? If it halts, after how many steps? Does the TM halt if it begins on a tape that contains a single letter A followed by blanks? Justify your answer.

Pllleasassseee ssiiirrrr soolveee thissssss questionnnnnnn

Chapter 17 Solutions

Starting Out with Java: From Control Structures through Data Structures (3rd Edition)

Ch. 17.1 - Prob. 17.1CP Ch. 17.1 - Prob. 17.2CP Ch. 17.1 - Prob. 17.3CP Ch. 17.1 - Prob. 17.4CP Ch. 17.2 - Prob. 17.5CP Ch. 17.2 - Prob. 17.6CP Ch. 17.2 - Prob. 17.7CP Ch. 17.2 - If a sequential search is performed on an array,...Ch. 17.3 - Prob. 17.9CP Ch. 17.3 - Prob. 17.10CP

Ch. 17.3 - Prob. 17.11CP Ch. 17.3 - Prob. 17.12CP Ch. 17.3 - Prob. 17.13CP Ch. 17.3 - Prob. 17.14CP Ch. 17.3 - Let a[ ] and b[ ] be two integer arrays of size n....Ch. 17.3 - Prob. 17.16CP Ch. 17.3 - Prob. 17.17CP Ch. 17.3 - Prob. 17.18CP Ch. 17 - Prob. 1MC Ch. 17 - Prob. 2MC Ch. 17 - Prob. 3MC Ch. 17 - Prob. 4MC Ch. 17 - Prob. 5MC Ch. 17 - Prob. 6MC Ch. 17 - Prob. 7MC Ch. 17 - Prob. 8MC Ch. 17 - Prob. 9MC Ch. 17 - Prob. 10MC Ch. 17 - True or False: If data is sorted in ascending...Ch. 17 - True or False: If data is sorted in descending...Ch. 17 - Prob. 13TF Ch. 17 - Prob. 14TF Ch. 17 - Assume this code is using the IntBinarySearcher...Ch. 17 - Prob. 1AW Ch. 17 - Prob. 1SA Ch. 17 - Prob. 2SA Ch. 17 - Prob. 3SA Ch. 17 - Prob. 4SA Ch. 17 - Prob. 5SA Ch. 17 - Prob. 6SA Ch. 17 - Prob. 7SA Ch. 17 - Prob. 8SA Ch. 17 - Prob. 1PC Ch. 17 - Sorting Objects with the Quicksort Algorithm The...Ch. 17 - Prob. 3PC Ch. 17 - Charge Account Validation Create a class with a...Ch. 17 - Charge Account Validation Modification Modify the...Ch. 17 - Search Benchmarks Write an application that has an...Ch. 17 - Prob. 8PC Ch. 17 - Efficient Computation of Fibonacci Numbers Modify...

Knowledge Booster