Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 14, Problem 5PP
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

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
    • 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

Filename: “QuickSorter2.java”

  • Define “QuickSorter2” 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
    • Define the “partition” method
      • Declare and the set the values
      • Check “i” is less than “j”
        • Increment the “i” value
        • Check “i” is less than “j” and “a[i]” is less than or equal to “pivot”
          • Check “a[i]” is equal to “pivot”
            • Increment the “i” value
            • Set the value
          • Increment the value
        • Decrement the “j” value
        • Check “i” is less than or equal to “j” and “a[i]” is greater than or equal to “pivot”
          • Check “a[j]” is equal to “pivot”
            • Decrement the “j” value
            • Set the value
          • Decrement the value
        • Check “i” is less than “j”
          • Call the “swap” method
              • Declare the required variables and set the values
              • Check the condition
                • Set the value
                • Check the condition
                  • Set the value
              • Check the condition
                • Set the value
              • Return the value

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
    • Define the “stop” method
      • Check the condition
        • Return the value
          • Set the values
    • Define the “getElaspedTime” method
      • Check the condition
        • Set the value
        • Return the value
          • Otherwise, return the elapsed time
    • Define the “reset” method
      • Set the value.

Blurred answer
Students have asked these similar questions
2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.
Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?
Consider the following expression in C: a/b > 0 && b/a > 0.What will be the result of evaluating this expression when a is zero? What will be the result when b is zero? Would it make sense to try to design a language in which this expression is guaranteed to evaluate to false when either a or b (but not both) is zero? Explain your answer

Chapter 14 Solutions

Big Java Late Objects

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education