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 16.1, Problem 16.1CP

Chapter 16.1, Problem 16.3CP

Students have asked these similar questions

Change the following code so that there is always at least one way to get from the left corner to the top right, but the labyrinth is still randomized. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. Take care that the player and the dragon cannot start off on walls. Also the dragon starts off from a randomly chosen position public class Labyrinth { private final int size; private final Cell[][] grid; public Labyrinth(int size) { this.size = size; this.grid = new Cell[size][size]; generateLabyrinth(); } private void generateLabyrinth() { Random rand = new Random(); for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { // Randomly create walls and paths grid[i][j] = new Cell(rand.nextBoolean()); } } // Ensure start and end are…

Change the following code so that it checks the following 3 conditions: 1. there is no space between each cells (imgs) 2. even if it is resized, the components wouldn't disappear 3. The GameGUI JPanel takes all the JFrame space, so that there shouldn't be extra space appearing in the frame other than the game. Main(): Labyrinth labyrinth = new Labyrinth(10); Player player = new Player(9, 0); Dragon dragon = new Dragon(9, 9); JFrame frame = new JFrame("Labyrinth Game"); GameGUI gui = new GameGUI(labyrinth, player, dragon); frame.add(gui); frame.setSize(600, 600); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setVisible(true); public class GameGUI extends JPanel { private final Labyrinth labyrinth; private final Player player; private final Dragon dragon; //labyrinth, player, dragon are just public classes private final ImageIcon playerIcon = new ImageIcon("data/images/player.png");…

Make the following game user friendly with GUI, with some simple graphics. The GUI should be in another seperate class, with some ImageIcon, and Game class should be added into the pane. The following code works as this: The objective of the player is to escape from this labyrinth. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. The player can move only in four directions: left, right, up or down. There are several escape paths in all labyrinths. The player’s character should be able to moved with the well known WASD keyboard buttons. If the dragon gets to a neighboring field of the player, then the player dies. Because it is dark in the labyrinth, the player can see only the neighboring fields at a distance of 3 units. Cell Class: public class Cell { private boolean isWall; public Cell(boolean isWall) { this.isWall = isWall; } public boolean isWall() { return…

Chapter 16 Solutions

EBK STARTING OUT W/JAVA:...DATA...

Ch. 16.1 - Prob. 16.1CP Ch. 16.1 - Prob. 16.2CP Ch. 16.1 - Prob. 16.3CP Ch. 16.1 - Prob. 16.4CP Ch. 16.2 - Prob. 16.5CP Ch. 16.2 - Prob. 16.6CP Ch. 16.2 - Prob. 16.7CP Ch. 16.2 - If a sequential search is performed on an array,...Ch. 16.3 - Prob. 16.9CP Ch. 16.3 - Prob. 16.10CP

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

Knowledge Booster