5. The algorithm below is used to find the largest element in a list of numbers.By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modifiedand how?01 target <- list[1]02 FOR EACH num IN list03 {04IF(num > target)0506target <- num0708 }09 DISPLAY(target)A. Line 01 becomes target <- list[2]B. Line 04 becomes IF (num < target)C. Line 04 becomes if (num <= target)D. Line 01 becomes list [0] <- target0000

5. The algorithm below is used to find the largest element in a list of nu By modifying one of the lines in the program it is possible to make ti and how? 01 target <- list[1] 02 FOR EACH num IN list 03 { 04 IF(num > target) 05 06 target <- num 07 08 } 09 DISPLAY(target) O A. Line 01 becomes target <- list[2] B. Line 04 becomes IF (num < target) C. Line 04 becomes if (num ce target) D. Line 01 becomes list[e] <- target

5. The algorithm below is used to find the largest element in a list of nu By modifying one of the lines in the program it is possible to make ti and how? 01 target <- list[1] 02 FOR EACH num IN list 03 { 04 IF(num > target) 05 06 target <- num 07 08 } 09 DISPLAY(target) O A. Line 01 becomes target <- list[2] B. Line 04 becomes IF (num < target) C. Line 04 becomes if (num ce target) D. Line 01 becomes list[e] <- target

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

he algorithm below is used to find the largest element in a list of numbers.By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?01 target <- list[1] 02 FOR EACH num IN list 03 { 04 IF(num > target) 05 { 06 target <- num 07 } 08 } 09 DISPLAY(target) a. Line 01 becomes target <- list[2] b. Line 01 becomes list[0] <- target c. Line 04 becomes if (num <= target) d. Line 04 becomes IF (num < target)
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)
Perl I CpSc 390 Usin Perl Programm: A list of names (names) is given : “Jo Peter Ann Fred Linda Joe”. Please do the following: print the names for the order number of the names find the name (CTRL-Z to exit from the input) a second list with other group of names is also given: ”Mary, George, Nick”. An extension of the first list (names) so that to include the new names is needed. Hint: try to keep space among the names make sorting reverse take the size of the list take the new list (from d) : peter linda joe jo fred an Nick Mary George and delete all the other names except : Joe, Peter, Mary, George. (in any order) . Give the name for the list as: names1
Let A={1,2,3...,10}. How many subsets B of A where B = │4│and the smallest element in B is 4? Write a computer program or develop an algorithm that lists all subsets according to the part (a). (Please display the all subsets).
Python Programming - (Duplicate Elimination) Part 1: Create a function that receives a list and returns a (possibly shorter) list containing only the unique values in sorted order. Test your function with a list of numbers and a list of strings. Program is to also display results, that's the sorted list containing values. Part 2: Instead of hard coding the list passed to the sorting functions, request list values from user. (Hint: Request two lists from user, one containing values and another containing string.) Have the program eliminate duplicated values and display the lists (tasks required in part 1).
Python only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…
Python only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…
python 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…
Modify the following program to read dictionary items from a file and write the inverted dictionary to a file: characters = {'Bugs':['Rabbit', 1940, 'boy'], 'Garfield': ['Cat', 1978, 'boy'], 'Tweety': ['Bird', 1942, 'girl'], 'Sandy': ['Squirrel', 1999, 'female']} print("Printing the original dictionary") print(characters) print("") def invert_dict(characters): inverse = dict() for key in characters: val = characters[key] for list_item in val: if list_item not in inverse: inverse[list_item] = [key] else: inverse[list_item].append(key) return inverse my_invert = invert_dict(characters) print("Printing the inverted dictionary") print(my_invert) Include the following: 1) The input file for your original dictionary (with at least six items).2) The Python program to read from a file, invert the dictionary, and write to a different file.3) The output file for your inverted dictionary.…
(python) calculating time in Bubble Sort the funtion will only run for 40 seconds create a list that stats with 5 and will be adding 5 each time, 5+5+5+5+...... until the program closes after 40seconds... #Bubble Sort def bubble_sort(a_list): for pass_num in range(len(a_list) - 1, 0, -1): for i in range(pass_num): if a_list[i] > a_list[i + 1]: temp = a_list[i] a_list[i] = a_list[i + 1] a_list[i + 1] = temp
• Create a function which takes a tuple and returns a dictionary which is a histogramto count how many times each number exists in the tuple:• The main program must take the dictionary, transform the items into a list,use sort () to order the list (in ascending order) and after that display the list. def histo_n (x):'' '(tuple) -> dictReturns a dictionaryPrecondition: the tuple contains integers>>> t = (1,2, -3,3,4, -3,3,3)>>> histo_n (t){1: 1, 2: 1, 3: 3, 4: 1, -3: 2}'' ' Subject: Python Programming
Load the JSON file below into Python as a dictionary; convert to a list and calculate the minimum velocity and maximum height using recursion. Introduce the space mission to the user and ask the user to guess a minimum velocity and maximum height, which the code should use as start points. Print the results (min & max to a file, and at the end read the file to display the results on the screen) This is partial data from the space mission Jason-3, flight number 26