EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
6th Edition
ISBN: 8220102010314
Author: Horstmann
Publisher: YUZU
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
The images I have uploaded are the part 1 to 4 and questions below are continue on the questions uploaded 5. C++ Class Template with Method Stubs #pragma once #include <iostream> #include <string> #include <stdexcept> #include <vector>   template <typename T> class HashTable { private:     struct Entry {         std::string key;         T value;         bool isOccupied;         bool isDeleted;         Entry() : key(""), value(), isOccupied(false), isDeleted(false) {}     };       Entry* table;     size_t capacity;     size_t size;     double loadFactorThreshold;           size_t customHash(const std::string& key) const {         size_t hash = 5381;         for (char c : key) {             hash = ((hash  <<  5) + hash)  +  c;         }         return hash;     }       size_t probe(const std::string& key, bool forInsert = false) const;     void resize();   public:     // Constructor     HashTable(size_t initialCapacity = 101);         // Big…
this project is NOT for graded(marks) purposes, please help me with the introduction. give me answers for the project. i will include an image explaining everything about the project.
Java Graphics (Bonus In this lab, we'll be practicing what we learned about GUIs, and Mouse events. You will need to implement the following: A GUI with a drawing panel. We can click in this panel, and you will capture those clicks as a Point (see java.awt.Point) in a PointCollection class (you need to build this). The points need to be represented by circles. Below the drawing panel, you will need 5 buttons: O о о ○ An input button to register your mouse to the drawing panel. A show button to paint the points in your collection on the drawing panel. A button to shift all the points to the left by 50 pixels. The x position of the points is not allowed to go below zero. Another button to shift all the points to the right 50 pixels. " The x position of the points cannot go further than the You can implement this GUI in any way you choose. I suggest using the BorderLayout for a panel containing the buttons, and a GridLayout to hold the drawing panel and button panels. Regardless of how…

Chapter 14 Solutions

EBK BIG JAVA: EARLY OBJECTS, INTERACTIV

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 - Sometimes, directory or file names have numbers in...Ch. 14 - Prob. 3PPCh. 14 - Prob. 4PPCh. 14 - Prob. 5PPCh. 14 - Prob. 6PPCh. 14 - Prob. 7PPCh. 14 - Prob. 8PPCh. 14 - Prob. 9PP
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