BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
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

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 “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
      • Otherwise, find the maximum value
    • 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
    • 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: “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
What happens to MAC addresses as frames travel from one node (device) to another? What happens to MAC addresses as frames travel from one network to another?  What happens to IP addresses as packets travel from one node (device) to another? What happens to IP addresses as packets travel from one network to another?
Can you check if my explation is correct: Challenge: Assume that the assigned network addresses are correct. Can you deduce (guess) what the network subnet masks are?  Explain while providing subnet mask bits for each subnet mask.  [Hint:  Look at the addresses in binary and consider the host ids]     To assume that the network addresses are correct, we take a look at the network ID and IP addresses. Take 20.0.0.0/8, we have an /8 prefix which is Class A, that provide us with 255.0.0.0. This means that there are 24 host bits while the network bits are 8. When compared to the IP address 20.255.0.7, we can perform an additional operation with the subnet mask giving us 20.0.0.0. The same happened with 20.0.0.89, which we also got 20.0.0.0. Therefore, these two IP addresses fall within the respective /8 subnet. For 200.100.10.0/30, the /30 is Class C with a subnet mask of 255.255.255.252, meaning 30 network bits and only two host bits. When applying the subnet mask and the IP addresses…
It is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far. (a) Developcode for filter processes. Declare the channels and use asynchronous message passing. Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.

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