write java code for two Sort methods and compare the time taken to execute each Sort. The code for both sort methods will be in the SAME java program (NOT two programs!). Write Java code to populate an integer array with 100 Random integers in the range of 1 to 100 (both inclusive) using SecureRandom class. Sort the above array using Selection Sort and output the sorted array as comma separated values. Calculate and output the execution time for Selection Sort using the code below. Sort the above array using Insertion Sort and output the sorted array as comma separated values. Calculate and output the execution time for Insertion Sort using the code below. ----- Code for calculating execution time---- long start = System.nanoTime(); ---- -- your code here--- --- long end = System.nanoTime(); long elapsedTime = end - start; // 1 millisecond = 1,000,000 nano seconds double elapsedMilliseconds= (double) elapsedTime / 1_000_000; System.out.println(elapsedMilliseconds + " milliseconds"); // Java allows you to use underscore in numeric literals. This feature was introduced in Java 7.  //This feature enables you to separate groups of digits in numeric literals- e.g. 1_000_000 ---- End of code for time calculation------

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
icon
Related questions
Question
100%

In this assignment you will write java code for two Sort methods and compare the time taken to execute each Sort.

The code for both sort methods will be in the SAME java program (NOT two programs!).

Write Java code to populate an integer array with 100 Random integers in the range of 1 to 100 (both inclusive) using SecureRandom class.

Sort the above array using Selection Sort and output the sorted array as comma separated values.

Calculate and output the execution time for Selection Sort using the code below.

Sort the above array using Insertion Sort and output the sorted array as comma separated values.

Calculate and output the execution time for Insertion Sort using the code below.

----- Code for calculating execution time----

long start = System.nanoTime();
----
-- your code here---
---
long end = System.nanoTime();

long elapsedTime = end - start;

// 1 millisecond = 1,000,000 nano seconds

double elapsedMilliseconds= (double) elapsedTime / 1_000_000;

System.out.println(elapsedMilliseconds + " milliseconds");

// Java allows you to use underscore in numeric literals. This feature was introduced in Java 7. 
//This feature enables you to separate groups of digits in numeric literals- e.g. 1_000_000

---- End of code for time calculation------

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Array
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education