Task 1: Implement and Test a Sorting Algorithm 1. Create a Java project and implement your own selection sort function algorithm. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Compare the time taken to sort the array using the selection sort algorithm with the time taken to sort the same array using the in-built Java sort method (Arrays.sort). 4. Conclude which one is faster Task 2: Implement and Test Binary Search 1. Implement the binary search algorithm in Java. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Use the binary search algorithm to find a specific element in the sorted array. 4. Compare the time taken to find the element using the binary search algorithm with the time taken to find the same element using the in-built Java binary search method (Arrays.binarySearch). Submission: 1. 2. Note: Submit the Java code for the selection sort algorithm, binary search algorithm, and the test code. Include the results of the comparison between the time taken by your implementation and the in-built Java methods. Ensure the code is well commented and easy to understand. Use a timer to measure the time taken for sorting and searching. Hint: you may use this to calculate your running time. long start Time = System.nanoTime(); .....your program.... long endTime = System.nanoTime(); long totalTime = endTime - startTime; System.out.println(totalTime);
Task 1: Implement and Test a Sorting Algorithm 1. Create a Java project and implement your own selection sort function algorithm. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Compare the time taken to sort the array using the selection sort algorithm with the time taken to sort the same array using the in-built Java sort method (Arrays.sort). 4. Conclude which one is faster Task 2: Implement and Test Binary Search 1. Implement the binary search algorithm in Java. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Use the binary search algorithm to find a specific element in the sorted array. 4. Compare the time taken to find the element using the binary search algorithm with the time taken to find the same element using the in-built Java binary search method (Arrays.binarySearch). Submission: 1. 2. Note: Submit the Java code for the selection sort algorithm, binary search algorithm, and the test code. Include the results of the comparison between the time taken by your implementation and the in-built Java methods. Ensure the code is well commented and easy to understand. Use a timer to measure the time taken for sorting and searching. Hint: you may use this to calculate your running time. long start Time = System.nanoTime(); .....your program.... long endTime = System.nanoTime(); long totalTime = endTime - startTime; System.out.println(totalTime);
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
Related questions
Question
100%
using the image below code using java
Transcribed Image Text:Task 1: Implement and Test a Sorting Algorithm
1. Create a Java project and implement your own selection sort function algorithm.
2.
Test your implementation by generating an array of random integers of size 100 and sorting
them using the selection sort algorithm.
3.
Compare the time taken to sort the array using the selection sort algorithm with the time taken
to sort the same array using the in-built Java sort method (Arrays.sort).
4. Conclude which one is faster
Task 2: Implement and Test Binary Search
1. Implement the binary search algorithm in Java.
2. Test your implementation by generating an array of random integers of size 100 and sorting
them using the selection sort algorithm.
3. Use the binary search algorithm to find a specific element in the sorted array.
4.
Compare the time taken to find the element using the binary search algorithm with the time
taken to find the same element using the in-built Java binary search method
(Arrays.binarySearch).
Submission:
1. Submit the Java code for the selection sort algorithm, binary search algorithm, and the test code.
2.
Include the results of the comparison between the time taken by your implementation and the
in-built Java methods.
Note:
Ensure the code is well commented and easy to understand.
Use a timer to measure the time taken for sorting and searching.
Hint: you may use this to calculate your running time.
long startTime = System.nanoTime();
.....your program....
long endTime = System.nanoTime();
long totalTime = endTime - startTime;
System.out.println(totalTime);
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
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.Recommended textbooks for you
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
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