This program will be a search demonstrator. Three sorts will be demonstrated and used for each type: int array Sequential search (unsorted) Sequential search (sorted) Binary search search (sorted) Integer ArrayList Sequential search (unsorted) Sequential search (sorted) Binary search search (sorted) Process for testing these searches: Low-level Operations (int array) Create an int array ([]) of 1000 random numbers Start the StopWatch Look for an int using the sequential search method Report the amount of time taken Sort the array (Your choice of method: selection, insertion, or binary - each method has its own problems - NO Collection framework) Start the StopWatch Look for an int using the sequential search method Report the amount of time taken Start the StopWatch Look for an int using the binary search method Report the amount of time taken High Level Operations (ArrayList - Collections Framework) Create an ArrayList of 1000 random numbers Start the StopWatch Look for an Integer using the Arrays sequential search method Report the amount of time taken Sort the array (Collection framework sort) Start the StopWatch Look for an Integer using the Arrays sequential search method Report the amount of time taken Start the StopWatch Look for an Integer using the Arrays binary search method Report the amount of time taken

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

See similar textbooks

Related questions

Concept explainers

Question

This program will be a search demonstrator. Three sorts will be demonstrated and used for each type:

int array
- Sequential search (unsorted)
- Sequential search (sorted)
- Binary search search (sorted)
Integer ArrayList
- Sequential search (unsorted)
- Sequential search (sorted)
- Binary search search (sorted)

Process for testing these searches:

Low-level Operations (int array)
- Create an int array ([]) of 1000 random numbers
- Start the StopWatch
- Look for an int using the sequential search method
- Report the amount of time taken
- Sort the array (Your choice of method: selection, insertion, or binary - each method has its own problems - NO Collection framework)
- Start the StopWatch
- Look for an int using the sequential search method
- Report the amount of time taken
- Start the StopWatch
- Look for an int using the binary search method
- Report the amount of time taken
High Level Operations (ArrayList - Collections Framework)
- Create an ArrayList of 1000 random numbers
- Start the StopWatch
- Look for an Integer using the Arrays sequential search method
- Report the amount of time taken
- Sort the array (Collection framework sort)
- Start the StopWatch
- Look for an Integer using the Arrays sequential search method
- Report the amount of time taken
- Start the StopWatch
- Look for an Integer using the Arrays binary search method
- Report the amount of time taken

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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