Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5.4, Problem 5QE
Program Plan Intro
“while” loop:
A while loop is a control flow statement whose basic purpose is to execute the block of statements repeatedly as long as the conditional statement is true.
- If the condition is false then it does not execute the block of statement.
Insertion sort
The algorithm is basically designed to organize and sort the array or list of elements in specific manner, that enables the system and user to get the final sorted array or a list of elements.
Generally, the insertion sort technique divides the list into two parts: sorted or unsorted list.
In the sorted list, the method assumes that one element of the list is already sorted and then it performs the operation on the unsorted list by inserting elements in its appropriate position in the sorted list.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Python language preferred
Write a program that counts, in the given list of integers below, the number of occurrences of each integer. loop through the list to assign keys and values to the dictionary. Use must use another loop to print the dictionary values for the output.
list1 = [1,2,3,3,2,4,5,6,3,2,4,5,2,3,4,5,6,3]
Thankyou for your help!
Select which of the following statements about searching for items in a list is incorrect.
Group of answer choices
1. In an unsorted list, if the item is not present in the list, we will need to check every single item. In a sorted list, if we start the search at the smallest item, at most we would only need to check all items smaller than the target. If we get to an item larger than the target we can end our search early. This would make searching faster in the sorted list.
2. Sorting a list only makes sense for primitive types (ints, doubles) and Strings but not objects. For this reason we cannot sort a list of objects, and will always have to check each object in a list when we search for a target object.
3. In an unsorted list you need to check each item, to see if it is the item you want. If the list is sorted you can look at the middle item and then you can direct your search to the relevant portion of the list (higher or lower). This is called binary search. This will…
Hi! I am doing this function but it isn't working. how can I fix it
def bubble_down(values: list, left: int, right: int) -> None: """Bubble down through values[left: right+1], swapping items that are out of order. Note that use of this slicing notation means that items values[left], values[left + 1], values[left + 2], ..., values[right] could be modified.
Precondition: left and right are valid indexes in values.
>>> list_example_1 = [4, 3, 2, 1, 0] >>> bubble_down(list_example_1, 1, 3) >>> list_example_1 [4, 1, 3, 2, 0] >>> list_example_2 = [4, 3, 2, 1, 0] >>> bubble_down(list_example_2, 0, 4) >>> list_example_2 [0, 4, 3, 2, 1] """ for i in range(left, right): if values[i] > values[i + 1]: values[i], values[i + 1] = values[i + 1], values[i]
Chapter 5 Solutions
Computer Science: An Overview (12th Edition)
Ch. 5.1 - Prob. 1QECh. 5.1 - Prob. 2QECh. 5.1 - Prob. 3QECh. 5.1 - Suppose the insertion sort as presented in Figure...Ch. 5.2 - A primitive in one context might turn out to be a...Ch. 5.2 - Prob. 2QECh. 5.2 - The Euclidean algorithm finds the greatest common...Ch. 5.2 - Describe a collection of primitives that are used...Ch. 5.3 - Prob. 2QECh. 5.3 - Prob. 3QE
Ch. 5.3 - Prob. 4QECh. 5.4 - Modify the sequential search function in Figure...Ch. 5.4 - Prob. 2QECh. 5.4 - Some of the popular programming languages today...Ch. 5.4 - Suppose the insertion sort as presented in Figure...Ch. 5.4 - Prob. 5QECh. 5.4 - Prob. 6QECh. 5.4 - Prob. 7QECh. 5.5 - What names are interrogated by the binary search...Ch. 5.5 - Prob. 2QECh. 5.5 - What sequence of numbers would be printed by the...Ch. 5.5 - What is the termination condition in the recursive...Ch. 5.6 - Prob. 1QECh. 5.6 - Give an example of an algorithm in each of the...Ch. 5.6 - List the classes (n2), (log2n), (n), and (n3) in...Ch. 5.6 - Prob. 4QECh. 5.6 - Prob. 5QECh. 5.6 - Prob. 6QECh. 5.6 - Prob. 7QECh. 5.6 - Suppose that both a program and the hardware that...Ch. 5 - Prob. 1CRPCh. 5 - Prob. 2CRPCh. 5 - Prob. 3CRPCh. 5 - Select a subject with which you are familiar and...Ch. 5 - Does the following program represent an algorithm...Ch. 5 - Prob. 6CRPCh. 5 - Prob. 7CRPCh. 5 - Prob. 8CRPCh. 5 - What must be done to translate a posttest loop...Ch. 5 - Design an algorithm that when given an arrangement...Ch. 5 - Prob. 11CRPCh. 5 - Design an algorithm for determining the day of the...Ch. 5 - What is the difference between a formal...Ch. 5 - Prob. 14CRPCh. 5 - Prob. 15CRPCh. 5 - The following is a multiplication problem in...Ch. 5 - Prob. 17CRPCh. 5 - Four prospectors with only one lantern must walk...Ch. 5 - Starting with a large wine glass and a small wine...Ch. 5 - Two bees, named Romeo and Juliet, live in...Ch. 5 - What letters are interrogated by the binary search...Ch. 5 - The following algorithm is designed to print the...Ch. 5 - What sequence of numbers is printed by the...Ch. 5 - Prob. 24CRPCh. 5 - What letters are interrogated by the binary search...Ch. 5 - Prob. 26CRPCh. 5 - Identity the termination condition in each of the...Ch. 5 - Identity the body of the following loop structure...Ch. 5 - Prob. 29CRPCh. 5 - Design a recursive version of the Euclidean...Ch. 5 - Prob. 31CRPCh. 5 - Identify the important constituents of the control...Ch. 5 - Identify the termination condition in the...Ch. 5 - Call the function MysteryPrint (defined below)...Ch. 5 - Prob. 35CRPCh. 5 - Prob. 36CRPCh. 5 - Prob. 37CRPCh. 5 - The factorial of 0 is defined to be 1. The...Ch. 5 - a. Suppose you must sort a list of five names, and...Ch. 5 - The puzzle called the Towers of Hanoi consists of...Ch. 5 - Prob. 41CRPCh. 5 - Develop two algorithms, one based on a loop...Ch. 5 - Design an algorithm to find the square root of a...Ch. 5 - Prob. 44CRPCh. 5 - Prob. 45CRPCh. 5 - Design an algorithm that, given a list of five or...Ch. 5 - Prob. 47CRPCh. 5 - Prob. 48CRPCh. 5 - Prob. 49CRPCh. 5 - Prob. 50CRPCh. 5 - Prob. 51CRPCh. 5 - Does the loop in the following routine terminate?...Ch. 5 - Prob. 53CRPCh. 5 - Prob. 54CRPCh. 5 - The following program segment is designed to find...Ch. 5 - a. Identity the preconditions for the sequential...Ch. 5 - Prob. 57CRPCh. 5 - Prob. 1SICh. 5 - Prob. 2SICh. 5 - Prob. 3SICh. 5 - Prob. 4SICh. 5 - Prob. 5SICh. 5 - Is it ethical to design an algorithm for...Ch. 5 - Prob. 7SICh. 5 - Prob. 8SI
Knowledge Booster
Similar questions
- 1. ax + b = 0, y = aeˣ! a,b ≠ 0a,b are constants number entered by the user. Find (x,y) and determine the quadrant of thecartesian plane. Print (x,y) and write which quadrant (I,II,III or IV). (PYTHON) 2. Write a program that sorts a list in ascending order. Don’t use sort method.Ask user number of list elements (at least 10 elements)Enter all elements from keyboard and printed.Sort your list. (PYTHON)arrow_forwardAlter insertion sort below to sort a list of strings instead of numbers. It shouldn't return anything - it should sort the list "in place". The sorting should ignore case. For example "Zebra" should come after "apple", "maRker" should come after "marble", etc. Name this function string_sort. After calling this function, the list that was passed in should now contain the exact same strings it did before, but in sorted order. def insertion_sort(a_list): """ Sorts a_list in ascending order """ for index in range(1, len(a_list)): value = a_list[index] pos = index - 1 while pos >= 0 and a_list[pos] > value: a_list[pos + 1] = a_list[pos] pos -= 1 a_list[pos + 1] = valuearrow_forwardGiven the following list { 10,9,-2,1}, sort the list using selection sort and fill out the following table. static void selectionSort(double [] list) {// find minimum in the list [i....list.length-1]for (int i=0;i<list.length;i++) {double currentMin=list[i];int currentMinIndex=i;for (int j=i+1;j<list.length;j++) {if (currentMin>list[j]){currentMin=list[j];currentMinIndex=j;}}// j for// swap list[i] with list[currentMindIndex ifnecessary.if (currentMinIndex!=i) {list[currentMinIndex]=list[i];list[i]=currentMin;}// if}// for}arrow_forward
- A user is going to enter numbers one at a time, entering 'q' when finished. Put the numbers in a list, sort it in numerical order, and print out the list. Then print out the middle element of the list. (If the list has an even number of elements, print the one just after the middle.) Remember that a list 1st of numbers can be sorted numerically by calling 1st.sort(), and can be printed with print(1st). You can assume that every entry is either a valid integer or is the letter 'q'. Examples: If the input is 4 3 6 7 3 q The output is [3, 3, 4, 6, 7] 4 If input is 4 3 6 7 3 2 q The output is [2, 3, 3, 4, 6, 7] 4arrow_forwardAssume, you have been given two lists. Your task is to multiply the first element of the first list, to the last element of the second list and store them in another list. Then, again multiply the second element of the first list, to the second last element of the second list, and so on. If any of your lists is out of element, and another list has some elements remaining, then just append the remaining elements to your final list and print the list.================================================ Given lists 1:list_one = [1, 4, 7, 5]list_two = [6, 1, 3, 9] Sample Output 1:[9, 12, 7, 30] Explanation 01: Here, from list_one’s 1st element, 1 has been multiplied with the last element of list_two 9. So, the product 1X9 =9 has been added to the answer. Then, from list_one’s 2nd element, 4 has been multiplied with the 2nd the last element of list_two 3. So, the product 3X4 =12 has been added to the answer. And so on. ================================================Given lists 2:list_one =…arrow_forwardWrite a program that counts, in the given list of integers below, the number of occurrences of each integer. You must loop through the list to assign keys and values to the dictionary. Use must use another loop to print the dictionary values for the output. - list1 = [1,2,3,3,2,4,5,6,3,2,4,5,2,3,4,5,6,3] Example Output (It must look like this): 1 is in the list 1 time(s).2 is in the list 4 time(s).3 is in the list 5 time(s).4 is in the list 3 time(s).5 is in the list 3 time(s).6 is in the list 2 time(s).arrow_forward
- the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28 Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition callarrow_forwardWrite a python program to get two numbers from user. If both numbers are even add them andprint and if both numbers are odd multiply them and print and if one is even / one is odd subtractthem and print.Question22: Write a python program to take the values from below list and add it to new dictionary usingfor loop. Keys of dictionaries are 1,2,3,4. Print the new dictionary as well.Marks = [15,24,67,80]arrow_forwardWrite a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the listarrow_forward
- A list is given an = {6,2,-4,13,7} Answer the following questions. a. What is n in an? b. List all the steps of sorting this list using insertion sort. c. What is the output of this search? And what does it indicate?arrow_forwardpython code. instructions are given within the quotation marks. 1) def get_misspelled_linear(dictionary, text): """ dictionary is a list of sorted words in the dictionary; you may assume all words in the dictionary are lower case and only contains a-z and apostrophe' text is a list of words from any given text. Use linear search to find the list of all misspelled words in text, a misspelled word is a word that is in the text but not in the dicionary. The comparison is case insensitive. For example if cat is in the dictionary, then CAT, cAt, cAT, cat and etc. are all considered to be valid word. Return the list of misspelled word. Your list of misspelled word must appear in the original order as they were in the text list and keep original form (upper/lower case) if dictionary has N words and text has K words, then the running time for this method will be O(NK) """ return [] 2) def get_misspelled_binary(dictionary, text): """ dictionary is a list of sorted words in the dictionary; you…arrow_forward1. What's in There? by CodeChum Admin Let's try defining the size of the list and create the contents of it on our own! And then, to give off a sense of excitement, let's try accessing the value of a list element in a random index position! Let's do this fast! Instructions: Create a variable that accepts a positive integer. Create an empty list. Then, using loops, add string values to your list using the input() function. The number of string values to be added are dependent on the inputted value on the first inputted integer. Create another variable that accepts a non-negative integer. The number must only range from 0 until the value of the first inputted integer. Using your understanding on accessing list elements, access and print out the list element having the index position of the second inputted integer. use java in programming languagearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning