Create a client that produces partly sorted arrays with the following features: 95% of the data are sorted, while 5% are random values. All items that are within 10 places of their array position Sorted, with the exception of 5% of the items that were distributed at random across the array. Create and test ideas about how such input will affect how well the algorithms in this part function

Create a client that produces partly sorted arrays with the following features: 95% of the data are sorted, while 5% are random values. All items that are within 10 places of their array position Sorted, with the exception of 5% of the items that were distributed at random across the array. Create and test ideas about how such input will affect how well the algorithms in this part function

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Create a client that creates partly sorted arrays with the following features: 95 percent sorted, the remaining 5% random valuesAll entries within ten spots of the array's ultimate positionExcept for 5% of the elements, which are randomly distributed across the array, the array has been sorted. Create and test theories about how such input affects the performance of the algorithms in this section.
Write a java labguage program to use parallel arrays to save User ID and Password. Ask the user to enter the user ID and Passwords for 3 users Save the above information in two parallel arrays (using the same index for each user) After the input is completed, ask the user to enter any user ID and then ask the password for that ID. Confirm if the User ID and password match, if not ask the password
For each increment, use shellsort to report the number of comparisons divided by the array size. Create a test client that tests the hypothesis that this number is a tiny constant by sorting arrays of random Double values with array sizes increasing powers of ten beginning at 100.
Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.
There is an array with the original content as follows5,6,7,20,33,44,46,47,48,99,101,102,105Now execute Sequential search, and the state of the sorted array has been completed in the array, how many comparisons are required for the following numbers?48 : ___100 : ___
Short answer (5 points): The insert, update, delete, and search functions discussed in the slides are designed such that there are no holes assumed to be in the unsorted array. Your friend thinks that they can be coded to be equally as good in the worst case situations even if there are holes while still only using just the array and a “currentSize” variable. Is he right? Address this by doing/answering the following: Describe how the search algorithm changes if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version? Describe how the update algorithm changes (if any) if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version? Describe how the delete algorithm changes since it no longer needs to “fill the hole”. What is its Big O() and is it significantly worse, better, or the same as the no hole version? Now describe an insert algorithm that has…
Create a program that will create a private jagged array with the following specifications: a. contains 10 rowsb. the length of the first row is 10, next row is 9…and the last row is 1c. each index contains the sum of its indexes
Write a code segment IN PYTHON that displays the items in a three-dimensional array. Each line of data should represent all the items at a given row and column, stretching back from the first depth position to the last one. The traversal should start at the first row, column, and depth positions and move through depths, columns, and rows
If two arrays of different dimensions are multiplied together, what will be the result? 1. The result will have the shape to fit the largest array dimensions and fill missing values with NaN 2. The result will have the shape to fit the smallest array dimensions and fill missing values with NaN 3. NumPy will treat the missing values as 1(copying the values of the larger arrays) 4. NumPy will return an error
Please keep the simulation neat and well organized. It is a request. Perform QuickSort on the given array. You need to show the whole simulation. A = [10,3,9,18,21,26,30,8,15,6,17].
Using Java & Apache NetBeans Provide screenshots of the OUTPUT! Create a two-dimensional array of type double to contain the three different SD Marks (JD521, PRG521, and IP521) for six different students. A single array of type String must be used to store the student names (Maxwell, Carl, Gerhard, Paul, James, and Cena). Allow a user to enter in a number, ranging from 1 to 6, which will represent the student position in the table MCSD max and present the marks for each respecting module. The program can only stop when the user enter a number greater than 6. Printout the student name including the JD521, PRG521, and IP521 max, the total of marks and the average of all marks. Use a condition statement to decide that the student has passed or not (Pass rate is 70).
Objective: To write a program to remove duplicates from an array entered via the command line. Please write a program to remove duplicates from the series of numbers specified on the command line. So your program should output just the distinct numbers that were on the command line. Sample output is below: MUST BE ABLE TO INPUT NUMBERS VIA COMMAND LINE > java -classpath .:/run_dir/junit-4.12.jar:target/dependency/* Main usage: java Main 5 4 2 4 8 To remove duplicates from the numbers 5, 4, 2, 4 and 8 > java Main 5 4 2 4 8 Here are the distinct numbers: 5, 4, 2, 8 > java Main 1 3 5 2 3 5 3 3 5 7 9 3 Here are the distinct numbers: 1, 3, 5, 2, 7, 9