Assume you are implementing an application where a large set of data elements is kept in a sorted list. If an important issue is speed of the sorting algorithm, which of the following algorithms would be preferred? a. Merge Sort b. Bubble Sort C. Selection Sort d. Insertion Sort

Assume you are implementing an application where a large set of data elements is kept in a sorted list. If an important issue is speed of the sorting algorithm, which of the following algorithms would be preferred? a. Merge Sort b. Bubble Sort C. Selection Sort d. Insertion Sort

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 10RQ

See similar textbooks

Similar questions

ing Your goal is to modify your Assignment 6 program to allow the user to pick up a random item and display a sorted list of the contents of the knap sack. Note: If you use the built in C++, the most you can make on this assignment is 4 out of 10. You are expected to right your own sort based on one of the algorithms covered in class. Your program should have the following: • The name of the program should be Assignment 6. • 3 comment lines (description of the program, author, and date). • Modify your Assignment 5 program to do the following: o Display a menu (use a switch statement to implement the menu) of actions ▪ Attack: • For now, just display that the user chose to attack ▪ Pick up Item: • Randomly add one of 6 items to an array named knapSack o You get to choose the item names • Display which item the user picked up ▪ Add an option to the main switch statement: Display Knap Sack contents • The contents of the knap sack must be sorted Make the code easy…
c++ For this problem, you will need to sort a list of 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). Your program will output the state of the initial list of numbers and also after each swap for each of the three sorting algorithms (selection, insertion, and bubble). Note: You want to use the version of insertion sort from Wikipedia. Do not perform swaps if they don't change the vector. Inputs: 8 8 4 1 7 5 9 3 2 1 6 3 8 4 2 9 4 2 5
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.…
Capital Quiz use pythonThe Capital Quiz ProblemWrite a program that creates a dictionary containing the U.S. states as keys, and their capitals asvalues. (Use the Internet to get a list of the states and their capitals.) The program should thenrandomly quiz the user by displaying the name of a state and asking the user to enter that state’s574capital. The program should keep a count of the number of correct and incorrect responses. (Asan alternative to the U.S. states, the program can use the names of countries and their capitals
Question1: define two lists of numbers (arrays) and ask the user to give the size of each, and then ask the user to fill the list(according to a size that he gave), then compare two arrays and determine whether they are equal? Note: two arrays are equal if all elements are equal. (Array not vector )
In Python, grades_dict = {'Wally': [87,96,70], 'Eva': [100,87,90], 'Sam': [94,77,90], 'Katie': [100,81,82], 'Bob': [83, 65, 85]} Ask user to enter the names of the rows, i.e., indices. You can use: len(grades) to get the number of rows of the DataFrame. In addition, using the sort_index() method, ask user whether they wish to sort by rows or by columns and whether to sort in ascending or descending order (do not use any if-else statements)
your goal is to modify your assignment 6 program to allow the user to pick up a random item and display a sorted list of the contents of the knap sack. note: if you use the built in c++, the most you can make on this assignment is 4 out of 10. you are expected to right your own sort based on one of the algorithms covered in class. your program should have the following: • the name of the program should be assignment 6. • 3 comment lines (description of the program, author, and date). • modify your assignment 5 program to do the following: o display a menu (use a switch statement to implement the menu) of actions ▪ attack: • for now, just display that the user chose to attack ▪ pick up item: • randomly add one of 6 items to an array named knapsack o you get to choose the item names • display which item the user picked up ▪ add an option to the main switch statement: display knap sack contents • the contents of the knap sack must be sorted The knapsack items are bananas, lays,…
In C program language, You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
1. Write a game of rock paper scissors, one of the choices will be from the user and the other from the computer (use random) Print results for each game.Play the games in a row until you exit the game. Explain each step as comment.Game rules:Rock crushes scissors, you win.Paper covers rock, you win.Scissors cut paper, you win. 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. 3. Write a code for craps game. Craps is a dice game in which the players make wagers on the outcome of the roll, or a series of rolls, of a pair of dice.The rules of the dice game craps are as follows:You roll two dice. Each die has six faces, which contain one, two, three, four, five and six spots, respectively. After the dice have come to rest, the sum of the spots on the two upward faces is calculated. If the sum is 7 or 11 on the first throw, you win and play is…
True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1)
True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario True If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
The question is in bold the other parts juts helps explain concepts . Write a function insertionsort(somelist) that applies the insertion sort algorithm. (You should use the pop and insert commands) Insertion sort works as follows remove the first element from the original list (mylist) and add it to a new list sortedlist. Then repeat, at each stage removing the first element (call it x) from mylist and adding it to sortedlist. The challenge is that it needs to be added at the correct position, which means scanning through sortedlist for the first element bigger than x and inserting x just before that point, or if there is no such element then inserting x at the end. We recollect two useful list commands you should use in this code: • x = mylist.pop(0) which lets x be the entry at index 0 of mylist while also removing that entry from mylist. (Generally x = mylist.pop(j) works in the obvious way.) • sortedlist.insert(i,x) which changes sortedlist by inserting x into it at index i (with…