Scribd
Upload
90 views11 pages

CS1103-programming2 Unit 1 Assignment

This document compares the runtime of selection sort and Java's built-in sort method for arrays of increasing size. For an array of 1000 random integers, selection sort took 0.005 seconds while the built-in sort was nearly instantaneous at 0.0 seconds. For an array of 10000 elements, selection sort was slower at 0.084 seconds and the built-in sort remained faster at 0.005 seconds. The runtime tests demonstrate that the built-in sort scales better to larger arrays than the selection sort algorithm.

Uploaded by

Tidings Tech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
90 views11 pages

CS1103-programming2 Unit 1 Assignment

This document compares the runtime of selection sort and Java's built-in sort method for arrays of increasing size. For an array of 1000 random integers, selection sort took 0.005 seconds while the built-in sort was nearly instantaneous at 0.0 seconds. For an array of 10000 elements, selection sort was slower at 0.084 seconds and the built-in sort remained faster at 0.005 seconds. The runtime tests demonstrate that the built-in sort scales better to larger arrays than the selection sort algorithm.

Uploaded by

Tidings Tech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

/**

* Runtime of the Selection sort is:0.005 Seconds

* Runtime of the In Built Sort method: 0.0 Seconds

* This time is for 1000 elements

*/

import [Link];

import [Link];
public class BenchmarkingSortingAlgorithms {

private static Scanner scan;

public static void selectionSort(int arr[])

int n = [Link];

// One by one move boundary of the unsorted subarray


for (int i = 0; i < n-1; i++)

// Find the minimum element in the unsorted array

int min_idx = i;

for (int j = i+1; j < n; j++)

if (arr[j] < arr[min_idx])


min_idx = j;

// Swap the found minimum element with the first

int temp = arr[min_idx];

arr[min_idx] = arr[i];

arr[i] = temp;

}
}

public static void printArrayBySelectionSort(int[] arr) {

for(int i=0;i<[Link];i++) {

[Link](arr[i]+" ");

public static void sortByInBuilt(int arr[]) {


[Link](arr);

public static void main(String[] args) {

scan = new Scanner([Link]);

[Link]("Enter the limit of the array:");

int limit = [Link]();


int[] arr = new int[limit];

for(int i = 0;i<[Link];i++) {

arr[i] = (int) ([Link]() * 100);

long startTime = [Link]();

selectionSort(arr);
long runTime = [Link]() - startTime;

[Link]("\nRun time of the Selection sort is:"+runTime/1000.0+" Seconds");

long startTime1 = [Link]();

sortByInBuilt(arr);

long runTime1 = [Link]()-startTime1;

[Link]("\nRun time of the In Built Sort method: "+runTime1/1000.0+" Seconds");


printArrayBySelectionSort(arr);

----------------------

output

---------

Enter the limit of the array:

50

Run time of the Selection sort is:0.0 Seconds


Run time of the In Built Sort method: 0.0 Seconds

0 1 1 2 14 16 16 17 17 18 23 23 24 25 28 28 29 29 31 32 37 37 38 38 39 40 41 42 56 58 60 62 63 67 71 72
74 76 77 77 79 79 81 86 89 94 94 95 96 96

-----------------------------------------------

Enter the limit of the array:

1000

Run time of the Selection sort is:0.011 Seconds

Run time of the In Built Sort method: 0.001 Seconds

---------------------------------

Enter the limit of the array:

10000
Runtime of the Selection sort is:0.084 Seconds

Runtime of the In Built Sort method: 0.005 Seconds

-----------------------------------

You might also like