n arraylist instead

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
icon
Related questions
Question

make the array an arraylist instead and include the file you used

### Implementing the MERGE-SORT() Algorithm

The 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 Requirements

Your 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.
Transcribed Image Text:### Implementing the MERGE-SORT() Algorithm The 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 Requirements Your 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.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Array
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education