Input: 1 1 6 3 8 4 2 3 9 2 4 Output: 1 Selection Sort 2 1 6 3 8 4 2 3 9 2 4 3 1 2 3 8 4 6 3 9 2 4 4 1 2 2 8 4 6 3 9 3 4 5 1 2 2 3 4 6 8 9 3 4 6 1 2 2 3 3 6 8 9 4 4 7 1 2 2 3 3 4 8 9 6 4 8 1 2 2 3 3 4 4 9 6 8 9 1 2 2 3 3 4 4 6 9 8 10 1 2 2 3 3 4 4 6 8 9 11 Insertion Sort 12 1 6 3 8 4 2 3 9 2 4 13 1 3 6 8 4 2 3 9 2 4 14 1 3 6 4 8 2 3 9 2 4 15 1 3 4 6 8 2 3 9 2 4 16 1 3 4 6 2 8 3 9 2 4 17 1 3 4 2 6 8 3 9 2 4 18 1 3 2 4 6 8 3 9 2 4 19 1 2 3 4 6 8 3 9 2 4 20 1 2 3 4 6 3 8 9 2 4 21 1 2 3 4 3 6 8 9 2 4 22 1 2 3 3 4 6 8 9 2 4 23 1 2 3 3 4 6 8 2 9 4 24 1 2 3 3 4 6 2 8 9 4 25 1 2 3 3 4 2 6 8 9 4 26 1 2 3 3 2 4 6 8 9 4 27 1 2 3 2 3 4 6 8 9 4 28 1 2 2 3 3 4 6 8 9 4 29 1 2 2 3 3 4 6 8 4 9 30 1 2 2 3 3 4 6 4 8 9 31 1 2 2 3 3 4 4 6 8 9 32 Bubble Sort 33 1 6 3 8 4 2 3 9 2 4 34 1 3 6 8 4 2 3 9 2 4 35 1 3 6 4 8 2 3 9 2 4 36 1 3 6 4 2 8 3 9 2 4 37 1 3 6 4 2 3 8 9 2 4 38 1 3 6 4 2 3 8 2 9 4 39 1 3 6 4 2 3 8 2 4 9 40 1 3 4 6 2 3 8 2 4 9 41 1 3 4 2 6 3 8 2 4 9 42 1 3 4 2 3 6 8 2 4 9 43 1 3 4 2 3 6 2 8 4 9 44 1 3 4 2 3 6 2 4 8 9 45 1 3 2 4 3 6 2 4 8 9 46 1 3 2 3 4 6 2 4 8 9 47 1 3 2 3 4 2 6 4 8 9 48 1 3 2 3 4 2 4 6 8 9 49 1 2 3 3 4 2 4 6 8 9 50 1 2 3 3 2 4 4 6 8 9 51 1 2 3 2 3 4 4 6 8 9 52 1 2 2 3 3 4 4 6 8 9 Example 2: Input: 1 1 6 3 8 4 2 Output: 1 2 1 6 3 8 4 2 3 1 2 3 8 4 6 4 1 2 3 4 8 6 5 1 2 3 4 6 8 6 Insertion Sort 7 1 6 3 8 4 2 8 1 3 6 8 4 2 9 1 3 6 4 8 2 10 1 3 4 6 8 2 11 1 3 4 6 2 8 12 1 3 4 2 6 8 13 1 3 2 4 6 8 14 1 2 3 4 6 8 15 Bubble Sort 16 1 6 3 8 4 2 17 1 3 6 8 4 2 18 1 3 6 4 8 2 19 1 3 6 4 2 8 20 1 3 4 6 2 8 21 1 3 4 2 6 8 22 1 3 2 4 6 8 23 1 2 3 4 6 8

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

In C ++ You will need to sort whitespace-separated integers using three different sort algorithms (described here: http://theoryapp.com/selection-insertion-and-bubble-sort/ and https://en.wikipedia.org/wiki/Insertion_sort). For each of the three sorting algorithms (selection, insertion, and bubble), your program should output the initial list of numbers as well as after each swap. Note: You should use the Wikipedia entry for insertion sort.

Do not perform swaps if they don't change the vector.

Example

Input:

1	1 6 3 8 4 2 3 9 2 4

Output:

1	Selection Sort
2	1 6 3 8 4 2 3 9 2 4
3	1 2 3 8 4 6 3 9 2 4
4	1 2 2 8 4 6 3 9 3 4
5	1 2 2 3 4 6 8 9 3 4
6	1 2 2 3 3 6 8 9 4 4
7	1 2 2 3 3 4 8 9 6 4
8	1 2 2 3 3 4 4 9 6 8
9	1 2 2 3 3 4 4 6 9 8
10	1 2 2 3 3 4 4 6 8 9
11	Insertion Sort
12	1 6 3 8 4 2 3 9 2 4
13	1 3 6 8 4 2 3 9 2 4
14	1 3 6 4 8 2 3 9 2 4
15	1 3 4 6 8 2 3 9 2 4
16	1 3 4 6 2 8 3 9 2 4
17	1 3 4 2 6 8 3 9 2 4
18	1 3 2 4 6 8 3 9 2 4
19	1 2 3 4 6 8 3 9 2 4
20	1 2 3 4 6 3 8 9 2 4
21	1 2 3 4 3 6 8 9 2 4
22	1 2 3 3 4 6 8 9 2 4
23	1 2 3 3 4 6 8 2 9 4
24	1 2 3 3 4 6 2 8 9 4
25	1 2 3 3 4 2 6 8 9 4
26	1 2 3 3 2 4 6 8 9 4
27	1 2 3 2 3 4 6 8 9 4
28	1 2 2 3 3 4 6 8 9 4
29	1 2 2 3 3 4 6 8 4 9
30	1 2 2 3 3 4 6 4 8 9
31	1 2 2 3 3 4 4 6 8 9
32	Bubble Sort
33	1 6 3 8 4 2 3 9 2 4
34	1 3 6 8 4 2 3 9 2 4
35	1 3 6 4 8 2 3 9 2 4
36	1 3 6 4 2 8 3 9 2 4
37	1 3 6 4 2 3 8 9 2 4
38	1 3 6 4 2 3 8 2 9 4
39	1 3 6 4 2 3 8 2 4 9
40	1 3 4 6 2 3 8 2 4 9
41	1 3 4 2 6 3 8 2 4 9
42	1 3 4 2 3 6 8 2 4 9
43	1 3 4 2 3 6 2 8 4 9
44	1 3 4 2 3 6 2 4 8 9
45	1 3 2 4 3 6 2 4 8 9
46	1 3 2 3 4 6 2 4 8 9
47	1 3 2 3 4 2 6 4 8 9
48	1 3 2 3 4 2 4 6 8 9
49	1 2 3 3 4 2 4 6 8 9
50	1 2 3 3 2 4 4 6 8 9
51	1 2 3 2 3 4 4 6 8 9
52	1 2 2 3 3 4 4 6 8 9

Example 2:

Input:

1	1 6 3 8 4 2

Output:

1
2	1 6 3 8 4 2
3	1 2 3 8 4 6
4	1 2 3 4 8 6
5	1 2 3 4 6 8
6	Insertion Sort
7	1 6 3 8 4 2
8	1 3 6 8 4 2
9	1 3 6 4 8 2
10	1 3 4 6 8 2
11	1 3 4 6 2 8
12	1 3 4 2 6 8
13	1 3 2 4 6 8
14	1 2 3 4 6 8
15	Bubble Sort
16	1 6 3 8 4 2
17	1 3 6 8 4 2
18	1 3 6 4 8 2
19	1 3 6 4 2 8
20	1 3 4 6 2 8
21	1 3 4 2 6 8
22	1 3 2 4 6 8
23	1 2 3 4 6 8

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions