Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
5th Edition
ISBN: 9780134801155
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem 6MC
Program Description Answer
Insertion sort
Hence, the correct answer is option “C”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
This algorithm makes several passes through an array and causes the larger values togradually move toward the end of the array with each pass.a. bubble sortb. selection sortc. insertion sortd. sequential sort
Given this array:
Sorting smallest to largest, draw this array after:
a) Two iterations of Bubble Sort
b) Two iterations of the outer (big) loop of Selection Sort
c) Two iterations of the outer (big) loop Insertion Sort
Show transcribed image text
Given this array:
Sorting smallest to largest, draw this array after:
a) Two iterations of Bubble Sort
b) Two iterations of the outer (big) loop of Selection Sort
c) Two iterations of the outer (big) loop Insertion Sort
Chapter 9 Solutions
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Ch. 9.3 - Which of the sorting algorithms discussed makes...Ch. 9.3 - Prob. 9.2CPCh. 9.3 - Prob. 9.3CPCh. 9.4 - Prob. 9.4CPCh. 9.4 - On average, with an array of 1,000 elements, how...Ch. 9.4 - Prob. 9.6CPCh. 9 - Prob. 1MCCh. 9 - Prob. 2MCCh. 9 - Prob. 3MCCh. 9 - Prob. 4MC
Ch. 9 - Prob. 5MCCh. 9 - Prob. 6MCCh. 9 - Prob. 7MCCh. 9 - Prob. 8MCCh. 9 - Prob. 9MCCh. 9 - Prob. 10MCCh. 9 - Prob. 1TFCh. 9 - Prob. 2TFCh. 9 - Prob. 3TFCh. 9 - Prob. 4TFCh. 9 - Prob. 5TFCh. 9 - Prob. 1AWCh. 9 - Prob. 2AWCh. 9 - Prob. 3AWCh. 9 - What algorithm does the following pseudocode...Ch. 9 - Prob. 1SACh. 9 - Prob. 2SACh. 9 - Prob. 3SACh. 9 - Prob. 4SACh. 9 - Prob. 5SACh. 9 - Why is the selection sort more efficient than the...Ch. 9 - Prob. 7SACh. 9 - Prob. 8SACh. 9 - Assume the following main module is in a program...Ch. 9 - Prob. 1PECh. 9 - Sorted Names Design a program that allows the user...Ch. 9 - Rainfall Program Modification Recall that...Ch. 9 - Name Search Modify the Sorted Names program that...Ch. 9 - Charge Account Validation Recall that Programming...Ch. 9 - Prob. 7PECh. 9 - Sorting Benchmarks Modify the modules presented in...
Knowledge Booster
Similar questions
- Write the state of the elements of each of the following arrays after each pass of the outermost loop of the selection sort algorithm has occurred (after each element is selected and moved into place).int[] numbers1 = {63, 9, 45, 72, 27, 18, 54, 36};int[] numbers2 = {37, 29, 19, 48, 23, 55, 74, 12};arrow_forwardQuick Sort is another sorting algorithm that follows a divide-and-conquer approach. The algorithm can be summarized in 3 steps: A pivot element is chosen, usually the first element. All elements smaller than the pivot are placed to the left of the pivot. This creates 2 partitions, elements greater than the pivot and elements less than the pivot. The 2 partitions are sorted using Quick Sort. Sample code in python3: def quick_sort(arr): def quick_sort_r(arr, start, end): if end - start < 2: # single element base case return # choose a pivot pivot = start # you may choose other elements store = pivot+1 # index to store less than elements # for all elements after the pivot for i in range(pivot+1, end): if arr[i] < arr[pivot]: # if element is less than pivot arr[i], arr[store] = arr[store], arr[i] # swap store += 1 # increment store index # swap pivot with last element in less than…arrow_forwardBubble sort is used to arrange an array in an ascending or descending order. If we are using this algorithm to sort an array in descending order, then what will be the order of values after complete execution of outer loop 3 times: 9, 1, 4, 5, 2, 8, 6, 11, 7, 0 *arrow_forward
- solve in python coding 3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)arrow_forwardHelp me please No programming required 1. Elementary sorts a) Sort the sequence I, L, O, V, E, A, L, G, O, R, I, T, H, M, S using the following sort methods. Show the trace after each iteration of the outer loop. Also, compare the best, worst, and average case scenarios for these algorithms. a. Insertion sort b. Selection sort c. Bubble sort b) Show in the style of the example discussed in class, how shell sorts the array E, A, S, Y, S, H, E, L, L, S, O, R, T, Q, U, E, S, T, I, O, Narrow_forwardGiven an array of size 10, which is sorted in ascending order, perform binary search. Write the binary search algorithm. At most how many steps will be required to find out the desired item?arrow_forward
- Write the algorithm which sorts the array by using the bubble sort algorithm. Then find the complexity of the algorithm as Big O notationarrow_forwardA square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2. Answer 1 and 2 questions with codearrow_forwardA square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2. Answer 3 and 4 Algorithmsarrow_forward
- A square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.arrow_forwardConsider the algorithm for insertion sort shown below. The input to this algorithm is an array A. You must assume that indexing begins at 1. Follow this algorithm for A[1..4] =< 7, 9, 6, 8 >. Specifically, please indicate the contents of the array after each iteration of the outer for loop.arrow_forwardWrite the algorithm which sorts the array by using the quick sort algorithm. Then find the complexity of the algorithm as Big O notation.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education