make the array an arraylist instead and include the file you used ### Implementing the MERGE-SORT() AlgorithmThe goal of this exercise is to implement a MERGE-SORT() algorithm that reads from a file named `inputHW02.txt`. This file contains a list of double numbers, with a maximum of 3,000,000 numbers. The program will sort these numbers and report the time taken for completion. The task will demonstrate the benefits of using iterative loops versus recursive calls and utilizing INSERTION-SORT() as a procedure within MERGE-SORT().#### Program RequirementsYour program should perform the following actions:1. **File Reading:** - Open the specified file and read all double numbers. - Assume that the file contains only numbers.2. **Insertion Sort:** - Implement the `INSERTION-SORT()` function, which sorts an array of a maximum of 25 numbers. - This will be used as a sub-procedure to sort smaller sub-arrays efficiently.3. **MERGE-SORT() Variants:** - Implement four versions of MERGE-SORT(): - **MERGE-SORT-A():** Uses recursive calls without INSERTION-SORT() as a sub-procedure. - **MERGE-SORT-B():** Uses iterative loops (i.e., no recursion) without INSERTION-SORT(). - **MERGE-SORT-C():** Uses recursive calls with INSERTION-SORT() as a sub-procedure. - **MERGE-SORT-D():** Uses iterative loops with INSERTION-SORT() as a sub-procedure.4. **Testing Procedure:** - Create a procedure to randomly generate `N` numbers and write them to a file named `filename`, where `N` and `filename` are input parameters.#### Experimentation and Reporting- Test the MERGE-SORT() implementations with different input sizes: `N = 1M, 1.5M, 2M, 2.5M, and 3M`.- For each input size `N`, execute step 4 to generate `N` numbers, write them to a file (e.g., `inputHW02.txt`), and then apply MERGE-SORT-A(), MERGE-SORT-B(), MERGE-SORT-C(), and MERGE-SORT-D().- Record and report the time consumption for each variant in a graphical format for easy comparison.

Answered: n arraylist instead

Engineering

Computer Science

n arraylist instead

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

slecetion sort (python) Selection sort is a sorting algorithm, like Bubble sort which you saw in the previous module. Selection sort works as follows: Selection sort divides the input list into two parts: a sublist of sorted items (left part) and a sublist of still unsorted items (right part). Initially, the sorted sublist is empty and the whole input consists of the unsorted sublist. To fill the sorted sublist, the algorithm computes the (index of) the minimum of the unsorted sublist and swaps the first unsorted element and the minimum element (if the minimum is already the first element, nothing happens). Afterward, the sorted sublist is one bigger. This continues until the unsorted sublist is empty and the entire input is sorted. Example: Sorted sublist Unsorted sublist Least element in unsorted list () (11, 25, 12, 22, 64) 11 (11) (25, 12, 22, 64) 12 (11, 12) (25, 22, 64) 22 (11, 12, 22) (25, 64) 25 (11, 12, 22, 25) (64) 64 (11, 12, 22, 25, 64) () Implement this…
please code in python Forbidden concepts: arrays/lists (data structures), recursion, custom classes Watch this video on the Fibonacci sequence. The first two numbers of the sequence are 1 and 1. The subsequent numbers are the sum of the previous two numbers. Create a loop that calculates the Fibonacci sequence of the first 25 numbers and prints each one.Lastly, state the 25th and 24th sequence in a sentence, and explain how the golden ratio is conducted from it, including what it is.Note: you don’t know what the 24th and 25th numbers are, get the program to find out and calculate itself what the ratio is.
erfd
By python
Exercise 1:In this problem, we would like to implement a variation of the Bubble Sort algorithm. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. The algorithm is illustrated as in the following figure: For the first step, we perform bubble sort from the index 1 to n (n is thenumber of elements in the array). The next step, we perform a reserved bubble sort from the index n to 1. The process is repeated until all the array is sorted. Propose a pseudo-code to complete the Bubble Sort algorithm. Implement and test this algorithm in C/C++. Analyze and compute the complexity of this algorithm in the best, average and worst scenarios.Exercise 2:Re-implement Exercise 1 using a linear data structure: List, Stack, Queue. Justify your choice of data structure.
KEYWORDS: array, for, nested loops. LAB EXERCISE: Program 1: Write a program for implementation of Binary search using function. c\Users\UmarDesktop\cppproj\Debu.oe Enter 5 Nunbers in ascending order : c\Users\Umar\Desktop\cppproj\Debu o O Enter 5 Nunbers in ascending order : 45 67 88 65 Enter iten to be searched : 12 Elenent not found Press any key to continue Enter iten to be searched : Elenent found at index - 1 Press any key to continue Sample Output: Program 1
l JO 100 4G 2:02 AM @ 52% assignment_3 v2 AI and ML Assignment 3 Write a python program to cluster candidates into 2/3 groups. The program performs dimensionality reduction, then clustering of candidates based on top 2 PCs. The results are plotted to visually show the performance of candidates. The program performs the following tasks: Read input "pca cluster.csv" file. Use Panda library. Example of the file: candi cand2 cand3 cand4 cand5 cad6 experience 10 9 7 3 education 10 10 8 10 health 4 6 8 9 9. interview 9 6 6 8 7 test 4 9. 10 communication skills 7. 6 9 10 10 writing skills team player leadership 10 9 6 6. 8 7 4 10 9 4 10 4 9 6 8 5 9 7 enthusiasm 7. 7 7 9 ready to start 5 6 6. 9 1 flexible in hours 10 1 9. 5 6. able to relocate 6 6 6. 10 4 references 9 9 7 9 4 10 • Apply PCA analysis to identify top 2 PCs. Eigen No. 0 Eigen value (33.50+0j) Contribution % (40.87+0j) Points on new scale [5 5-8 3 0-5] Eigen No. I Eigen value- (22.65+Oj) Contribution % (27.63+0j) Points on new…
Exercise 1: Write a main program that reads the elements of a 2 x 2 integer matrix, A, from the user. It then performs the following tasks: • prints the matrix row-by-row using a nested looping structure, • adds all matrix elements in row 0 using a looping structure and prints the sum. For example, for matrix, A| [i 3 A[2][2] = 7 9 The Sample Session will be as follows: CA Microsoft Visual Studio Debug Console Enter element at row 0 column 0: 1 Enter element at row e column 1: 3 Enter element at row 1 column 0: 7 Enter element at row 1 column 1: 9 The matrix entered by the user is: 13 7 9 Sum of row 0 elements: 4 C:\Users\User\source\repos \Project1\Debug\Project1.exe (process 52912) exited with code 0. Press any key to close this window
Python Write a program that allows the user to add, view, and delete names in an array list. The program must present the user with options (add, view, or delete) to choose from and an option to quit/exit the program. For example: Add adds name(s) to the list. View - view name(s) in the list. Delete - removes name(s) from the list. The user must type the option (Add, View, or Delete), and the program must work accordingly.
* allSame returns true if all of the elements in list have the same value. * allSame returns false if any two elements in list have different values. * The array may be empty and it may contain duplicate values. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * * * * true == allSame (new double[] { }) true == allSame(new double[] {11}) true == allSame (new double[] { 11, 11, 11, 11 }) false == allSame(new double[] { 11, 11, 11, 22 }) false == allSame (new double[] { 11, 11, 22, 11 }) true == allSame (new double[] { 22, 22, 22, 22 }) * */ public static boolean allSame (double[] list) { return StdRandom.bernoulli(); //TODO: fix this
Python
Exercise: norm loop [**] Modify your implementation of norm to use a loop. Here is pseudocode for what you should do: initialize norm to 0.0 loop through array add to norm the square of the current array component return sqrt of norm