Consider the following list => [40, -5, 45, 55, 1, 60, 15, 95, -85, 5] Each of the following is a view of a sort in progress of the above list. Which sort is which? Explain your answer. [Hint: each sort is used exactly once], Choose between bubble sort, selection sort, and merge sort (1) [-5, 1, 40, 45, 55, -85, 5, 15, 60, 95] Sorting Algorithm is (2) [-5,1, 40, 15, 45, -85, 5, 55, 60, 95] Sorting Algorithm is. ......... (3) [-85, -5, 1, 55, 45, 60, 15, 95, 40, 5] Sorting Algorithm is ........

Consider the following list => [40, -5, 45, 55, 1, 60, 15, 95, -85, 5] Each of the following is a view of a sort in progress of the above list. Which sort is which? Explain your answer. [Hint: each sort is used exactly once], Choose between bubble sort, selection sort, and merge sort (1) [-5, 1, 40, 45, 55, -85, 5, 15, 60, 95] Sorting Algorithm is (2) [-5,1, 40, 15, 45, -85, 5, 55, 60, 95] Sorting Algorithm is. ......... (3) [-85, -5, 1, 55, 45, 60, 15, 95, 40, 5] Sorting Algorithm is ........

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

Similar questions

Select true or false for the statements below. Explain your answers if you like to receive partial credit 10) Which of the following is true about the linked list functions where the linked list onlycontains a head pointer?a. If the linked list is ordered, you can use binary search and improve theperformance to O(log n)b. The worst case performance of the delete function is in the same Big-Ocategory as the worst case performance of the delete function with anunordered arrayc. If the node you are deleting is at the end of the list, the performance is O(1)
Consider the following list: L = ['bran', 'tyrion', 'jon', 'sansa', 'drogon', 'ned', 'arya', 'ghost'] In the table below, show the contents of the list after each of the first three iterations of the outer while-loop in merge_sort
Consider a list L = {387, 690, 234, 435, 567, 123, 441}. Here, the number ofelements n = 7, the number of digits l = 3 and radix r = 10. This means that radixsort would require 10 bins and would complete the sorting in 3 passes. illustrates the passes of radix sort over the list. It is assumed that each key is thrown into the bin face down. At the end of each pass, when the keys are collected from each bin in order, the list of keys in each bin is turned upside down to be appended to the output list
Use the standard linked list below to answer True/False statements 9-12: 9) The “head” pointer of this list is pointing to Node 4 10) If we called “insert(5)”, the new node’s “next” pointer will point to Node 8 11) If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 12) If we called “search(20)”, the “head” pointer will be at Node 4 after the search function ends
Use the standard linked list below to answer True/False statements 11-12: 11) If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 12) If we called “search(20)”, the “head” pointer will be at Node 4 after the search function ends
Now implement the mergesort function. In the base case (len(lst)<2), return the list itself. Otherwise, split the list into a left half and a right half recursively and use the above merge() function to combine sub-results. Note: Use integer division // when computing the length for each subproblem. from random import randint def mergesort(lst): """Implementation of the MergeSort algorithm. Precondition: lst is a list containing elements that can be compared. :param lst - a list of comparable elements :resut - a list containing all elements in lst in ascending order.""" pass # your code goes here ## wrapper to return a shuffled list, shuffle() updates the input list def shuffled(lst): result = [elem for elem in lst] ## copy lst shuffle(result) return result tests = [ [ [shuffled([n for n in range(20)])], [n for n in range(20)]], [ [[n for n in range(19,-1,1)]], sorted([n for n in range(19,-1,1)])], [ [[]], []],…
The code fragment above contains an implementation of one of the sorting algorithms that was discussed in class and a list of integers named my_list. If this algorithm were called to sort my_list then what would be the contents of that list after 4 iterations of the outermost loop of that algorithm? This question is internally recognized as variant 232. Q8) [18, 25, 36, 45, 14, 58, 47, 19, 21, 54, 64, 44, 66, 27, 67, 15, 65, 50, 68, 69] [14, 15, 18, 19, 21, 25, 27, 36, 44, 45, 47, 50, 54, 58, 64, 65, 66, 67, 68, 69] [14, 15, 25, 45, 36, 58, 18, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 64, 65, 50] [18, 64, 25, 45, 36, 58, 14, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 15, 65, 50] [18, 25, 45, 36, 58, 14, 64, 47, 19, 21, 54, 66, 44, 68, 27, 67, 15, 65, 50, 69] [14, 15, 18, 45, 36, 58, 25, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 64, 65, 50] [14, 15, 18, 19, 21, 58, 25,…
Write a comparator for Person named SectorPayOrder that will allow a primary sort in ascending order of sector, and a secondary sort in ascending order of payrate where sectors match. attempted code
Create a sort implementation that counts the variety of key values before sorting the array using key-indexed counting using a symbol table. (This approach should not be used if there are many distinct key values.)
The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 2 16 38 9 4 14 How many passes must the algorithm perform to guarantee the entire sequence is sorted? What is the list obtained after the first pass? What is the list obtained after the third pass? What is the list obtained after the final pass?
Implement two out of three of the basic sorting algorithms - Bubble Sort, Selection Sort, and Insertion Sort - in a generic List. Initial code to be completed: #include <iostream>#include "linkedlist.h" void bubbleSort(List*);void selectionSort(List*);void insertionSort(List*); /** * This activity is focused on using Arrays and Linked Lists as two different * implementations of List. It follows that you are only to use the methods of * List and not of the specific array or linkedlist. */int main(void) { // WARNING! Do not modify main method! // Doing so will nullify your score for this activity. char li; cin >> li; List* list; if (li == 'A') { list = new ArrayList(); } else { list = new LinkedList(); } int length; cin >> length; int input; for (int i = 0; i < length; i++) { cin >> input; list->add(input); } char sym; cin >> sym; int arg1; switch (sym) {…
Make a sort implementation that uses key-indexed counting with a symbol table to count the range of key values before sorting the array. (If there are several unique key values, this method shouldn't be utilised.)