
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Reference the
(a) Write code to implement the algorithm in python.
(b) Using the list L = 60, 35, 82, 112, 9, 50 as your input, print the output of the
algorithm.
(c) Modify the algorithm to
a. print the array Count after each iteration of i in the nested for loop
(second for loop).
b. include code to count the number of times the if statement is executed.
c. print the S array.
![ALGORITHM Comparison Counting Sort(A[0..n-1])
//Sorts an array by comparison counting
//Input: Array A[0..n-1] of orderable values
//Output: Array S[0..n-1] of A's elements sorted
// in nondecreasing order
for i 0 ton - 1 do
Count[i] +0
for i 0 to n - 2 do
for ji+ 1 to n - 1 do
if A[i]<A[j]
Count[j] Count[j]+1
else Count[i] <Count[i] + 1
for i 0 ton - 1 do
S[Count[i]] ← A[i]
return S](https://content.bartleby.com/qna-images/question/16a501d0-ad86-4e86-a9d4-08a716d78319/10f18004-98ca-4454-b7e0-2dbe0fc32bda/pea6xv_thumbnail.png)
Transcribed Image Text:ALGORITHM Comparison Counting Sort(A[0..n-1])
//Sorts an array by comparison counting
//Input: Array A[0..n-1] of orderable values
//Output: Array S[0..n-1] of A's elements sorted
// in nondecreasing order
for i 0 ton - 1 do
Count[i] +0
for i 0 to n - 2 do
for ji+ 1 to n - 1 do
if A[i]<A[j]
Count[j] Count[j]+1
else Count[i] <Count[i] + 1
for i 0 ton - 1 do
S[Count[i]] ← A[i]
return S
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 4 steps with 4 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a python program. That does the following:1. prompts the user to guess a letter in a hard-coded word2. validates the input3. adds the letter to a two-dimensional array that stores the guessed letter (string) and the number of times that letter has been guessed (int). If the letter is already in the list, then the list should be updated accordingly (i.e., no duplicate letters in the list!)The list will follow this format:[[guessed letter1, number of guesses], [guessed letter2, number of guesses], ...]Example:[[“a”, 3], [“e”, 2], [“c”, 1]]Hint: this will require iterating over the list, remember that the character is always in position [x][0]4. check if the character is in the word5. outputs if the character is in the word and the number of times this character has been guessed6. the program should continue to prompt the user until they enter ‘quit’ Example:# the word is kookaburraEnter a letter: aThe letter ‘a’ is in the wordNumber of times guessed the letter ‘a’: 1Enter a…arrow_forwardWrite a program to sort an array of random elements using quicksort as follows: Sort the arrays using pivot as the first element of the array Sort the arrays using pivot as the median of the first, last, and middle elements of the array Sort the arrays using pivot as the first element of the array. However,, when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 1 2 3 4 5 6 7 8 0 (median of 1, 5, 0 is 1) 8 0 1 2 3 4 5 6 7 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your…arrow_forwardModify the code to generate the Fibonacci sequence in the following ways, and complete each ofthe tasks using both the for- and while-loop.(a) Change the first two elements to 2 and 2.(b) Change the first two elements to 3 and 2.(c) Change the update rule from summing successive elements to taking differences of successiveelements. For example, the third element is defined as the second element minus the first element, andso on.(d) Change the update rule so that each element is defined as the sum of the three precedingelements. Set the third element as 1 in order to start the process.arrow_forward
- I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…arrow_forwardWrite a program that will take the values of a DWORD array: 12h, 34h, 56h, 78h, 9Ah, BCh, DEh, F0h and reverse them. The programs should be written in Assembly and should contain comments for each of the relevant lines of code.arrow_forwardCAN THIS PLEASE BE DONE In PYTHON? Input a list of employee names and salaries and store them in parallel arrays. End the input with a sentinel value. The salaries should be floating point numbers Salaries should be input in even hundreds. For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees. Then find the names and salaries of any employee who's salary is within 5,000 of the average. So if the average is 30,000 and an employee earns 33,000, his/her name would be found. Display the following using proper labels. Save your file using the naming format LASTNAME_FIRSTNAME_M08 FE. Turn in your file by clicking on the Start Here button in the upper right corner of your screen. 1.Display the names and salaries of all the employees. 2. Display the average of all the salaries 3. Display all employees that are within 5,000 range of the average.arrow_forward
arrow_back_ios
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