Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 14, Problem 4PP
Program Plan Intro
Quicksort
Program plan:
Filename: “Main.java”
- Include the header files
- Define “Main” class
- Define the “main” method
- Declare the variables and set the values.
- Create an object for “StopWatch” class
- Call the required methods
- Check the “a” value as sorted or not
- Display the elapsed time.
- Call the required methods
- Check the “a2” value as sorted or not
- Display the elapsed time
- Define the “checkSorted” method
- Iterate the loop to check the array values are sorted or unsorted
- Return false
-
- Return true
- Iterate the loop to check the array values are sorted or unsorted
- Define the “main” method
Filename: “ArrayUtil.java”
- Include the header files
- Define “ArrayUtil” class
- Create an object for “Random” class
- Define the “randomIntArray” method
- Declare the array variable
- Iterate the loop until it reaches array length
- Generate the random values
- Return the value
- Define the “swap” method
- Swap the values
Filename: “QuickSorter.java”
- Define “QuickSorter” class
- Define the “sort” method
- Call the “sort” method
- Define the “sort” method with the arguments
- Check the condition.
- Return the value
- Call the required methods
- Return the value
- Check the condition.
- Define the “partition” method
- Declare and the set the values
- Check “i” is less than “j”
- Increment the “i” value
- Check “a[i]” is less than “pivot”
- Increment the “i” value
- Decrement the “j” value
- Check “a[j]” is greater than “pivot”
- Decrement the “j” value
- Check “i” is less than “j”
- Call the “swap” method
-
- Return the value
- Define the “sort” method
Filename: “QuickSorter2.java”
- Define “QuickSorter2” class
- Define the “med” method
- Check “a” is less than “b”
- Check “b” is less than “c”
- Return the value
- Otherwise, find the maximum value
- Otherwise, check “c” is less than “b”
- Return the value
- Check “b” is less than “c”
- Otherwise, find the maximum value
- Check “a” is less than “b”
- Define the “getPivot” method
- Declare the variable and set the value
- Check the “n” is less than or equal to 7
- return the value
- Check the “n” is less than or equal to 40
- return the value
- otherwise, declare the array
- check the condition
- set the value
- check the condition
- Define the “sort” method
- Call the “sort” method
- Define the “sort” method with the arguments
- Check the condition.
- Return the value
- Call the required methods
- Check the condition.
- Define the “partition” method
- Declare and the set the values
- Check “i” is less than “j”
- Increment the “i” value
- Check “a[i]” is less than “pivot”
- Increment the “i” value
- Decrement the “j” value
- Check “a[j]” is greater than “pivot”
- Decrement the “j” value
- Check “i” is less than “j”
- Call the “swap” method
- Return the value
- Define the “med” method
Filename: “StopWatch.java”
- Define “StopWatch” class
- Declare the required variables
- Define the constructor
- Call the “reset” method
- Define the “start” method
- Check the condition
- Return the value
- Set the values
- Return the value
- Check the condition
- Define the “stop” method
- Check the condition
- Return the value
- Set the values
- Return the value
- Check the condition
- Define the “getElaspedTime” method
- Check the condition
- Set the value
- Return the value
- Otherwise, return the elapsed time
- Check the condition
- Define the “reset” method
- Set the value.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionChapter 14 Solutions
Big Java Late Objects
Ch. 14.1 - Prob. 1SCCh. 14.1 - Prob. 2SCCh. 14.1 - Prob. 3SCCh. 14.1 - Prob. 4SCCh. 14.2 - Prob. 5SCCh. 14.2 - Prob. 6SCCh. 14.3 - Prob. 7SCCh. 14.3 - Prob. 8SCCh. 14.3 - Prob. 9SCCh. 14.3 - Prob. 10SC
Ch. 14.3 - Prob. 11SCCh. 14.3 - Prob. 12SCCh. 14.4 - Prob. 13SCCh. 14.4 - Prob. 14SCCh. 14.4 - Prob. 15SCCh. 14.5 - Prob. 16SCCh. 14.5 - Prob. 17SCCh. 14.6 - Prob. 18SCCh. 14.6 - Prob. 19SCCh. 14.6 - Prob. 20SCCh. 14.7 - Prob. 21SCCh. 14.7 - Prob. 22SCCh. 14.7 - Prob. 23SCCh. 14.7 - Prob. 24SCCh. 14.7 - Prob. 25SCCh. 14.7 - Prob. 26SCCh. 14.8 - Prob. 27SCCh. 14.8 - Prob. 28SCCh. 14.8 - Prob. 29SCCh. 14.8 - Prob. 30SCCh. 14 - Prob. 1RECh. 14 - Prob. 2RECh. 14 - Prob. 3RECh. 14 - Prob. 4RECh. 14 - Prob. 5RECh. 14 - Prob. 6RECh. 14 - Prob. 7RECh. 14 - Prob. 8RECh. 14 - Prob. 9RECh. 14 - Prob. 10RECh. 14 - Prob. 11RECh. 14 - Prob. 12RECh. 14 - Prob. 13RECh. 14 - Prob. 14RECh. 14 - Prob. 15RECh. 14 - Prob. 16RECh. 14 - Prob. 17RECh. 14 - Prob. 18RECh. 14 - Prob. 19RECh. 14 - Prob. 20RECh. 14 - Prob. 21RECh. 14 - Prob. 22RECh. 14 - Prob. 23RECh. 14 - Prob. 24RECh. 14 - Prob. 25RECh. 14 - Prob. 26RECh. 14 - Prob. 27RECh. 14 - Prob. 28RECh. 14 - Prob. 29RECh. 14 - Prob. 30RECh. 14 - Prob. 1PECh. 14 - Prob. 2PECh. 14 - Prob. 3PECh. 14 - Prob. 4PECh. 14 - Prob. 5PECh. 14 - Prob. 6PECh. 14 - Prob. 7PECh. 14 - Prob. 8PECh. 14 - Prob. 9PECh. 14 - Prob. 10PECh. 14 - Prob. 11PECh. 14 - Prob. 12PECh. 14 - Prob. 13PECh. 14 - Prob. 14PECh. 14 - Prob. 15PECh. 14 - Prob. 16PECh. 14 - Prob. 17PECh. 14 - Prob. 18PECh. 14 - Prob. 1PPCh. 14 - Prob. 2PPCh. 14 - Prob. 3PPCh. 14 - Prob. 4PPCh. 14 - Prob. 5PPCh. 14 - Prob. 6PPCh. 14 - Prob. 7PPCh. 14 - Prob. 8PPCh. 14 - Prob. 9PP
Knowledge Booster
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