Write a program that obtains the execution time of selection sort, radix sort, b

Question

Write a program that obtains the execution time of selection sort, radix sort, bubble sort, merge sort, quick sort, and heap sort for input size 50000, 100,000, 150,000, 200,000, 250,000, and 300,000. Your program should create data randomly and print a table like this:

In the same program, obtain the execution time of selection sort, radix sort, bubble sort, and heap sort for input size 2,000,000, 3,000,000, 4,000,000, and 5,000,000.

(Hint: You can use the code template below to obtain the execution time.)

long startTime = System.currentTimeMillis();

perform the task;

long endTime = System.currentTimeMillis();

long executionTime = endTime - startTime;

Explanation / Answer

import java.util.ArrayList;

public class chegg {

public static void main(String[] args) {

System.out.print("|Array siize |Selectin Sort|Bubble Srt |Merge Srt |Quick Srt |Heap Srt |Radix Srt |");
for (int i = 50000; i <= 300000; i += 50000) {
printValue(i);

}

}

public static void printValue(int arraySize) {

int strWidth = 14;
  
int[] list = new int[arraySize];

for (int i = 0; i < list.length; i++) {

list[i] = (int)(Math.random() * 1000000);
}

System.out.print(" |");

for (int i = 0; i < 7; i++) {

for (int j = 0; j < strWidth; j++) {

System.out.print("-");

}

System.out.print("|");

}
  
System.out.printf(" |%" + strWidth + "d|", arraySize);

  
int[] list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);

long startTime = System.currentTimeMillis();

selectionSort(list2);

long endTime = System.currentTimeMillis();

long executionTime = endTime - startTime;

System.out.printf("%" + strWidtth + "d|", executinTime);

  
  
list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);

startTime = System.currentTimeMillis();
  
bubbleSort(list2);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.printf("%" + strWidth + "d|", executionTime);

  
list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);
  
startTime = System.currentTimeMillis();

mergeSort(list2);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.printf("%" + strWidth + "d|", executionTime);

  
list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);
  
startTime = System.currentTimeMillis();

quickSort(list2);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.printf("%" + strWidth + "d|", executionTime);

  
list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);

startTime = System.currentTimeMillis();

heapSort(list2);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.printf("%" + strWidth + "d|", executionTime);
  
list2 = new int[arraySize];

System.arraycopy(list, 0, list2, 0, list.length);

startTime = System.currentTimeMillis();

radixSort(list2, 1000000);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.printf("%" + strWidth + "d|", executionTime);
  
  
  
  
}

public static void selectionSort(int[] list) {

for (int i = 0; i < list.length - 1; i++) {

int currentMin = list[i];

int currentMinIndex = i;

for (int j = i + 1; j < list.length; j++) {

if (currentMin > list[j]) {

currentMin = list[j];

currentMinIndex = j;

}
}
if (currentMinIndex != i) {

list[currentMinIndex] = list[i];

list[i] = currentMin;

}
}
}

public static void bubbleSort(int[] list) {

boolean needNextPass = true;

for (int k = 1; k < list.length && needNextPass; k++) {

// Array may be sorted and next pass not needed

needNextPass = false;

for (int i = 0; i < list.length - k; i++) {

if (list[i] > list[i + 1]) {

// Swap list[i] with list[i + 1]

int temp = list[i];

list[i] = list[i + 1];

list[i + 1] = temp;

needNextPass = true; // Next pass still needed

}
}
}
}


public static void mergeSort(int[] list) {

if (list.length > 1) {

// first part of merge sort

int[] firstHalf = new int[list.length / 2];

System.arraycopy(list, 0, firstHalf, 0, list.length / 2);

mergeSort(firstHalf);

// second part of merge sort

int secondHalfLength = list.length - list.length / 2;

int[] secondHalf = new int[secondHalfLength];

System.arraycopy(list, list.length / 2, secondHalf, 0,

secondHalfLength);

mergeSort(secondHalf);

// Merge first with second part into list

merge(firstHalf, secondHalf, list);

}
}
public static void merge(int[] list1, int[] list2, int[] temp) {

int current1 = 0; //list 1 Current index

int current2 = 0; // list 2 Current index

int current3 = 0; // Current index in temp

while (current1 < list1.length && current2 < list2.length) {

if (list1[current1] < list2[current2])

temp[current3++] = list1[current1++];

else

temp[current3++] = list2[current2++];
}

while (current1 < list1.length)

temp[current3++] = list1[current1++];

while (current2 < list2.length)

temp[current3++] = list2[current2++];

}


public static void quickSort(int[] list) {

quickSort(list, 0, list.length - 1);
}

private static void quickSort(int[] list, int first, int last) {

if (last > first) {

int pivotIndex = partition(list, first, last);

quickSort(list, first, pivotIndex - 1);

quickSort(list, pivotIndex + 1, last);

}

}

/** Partitioning here the array list[first...last] */

private static int partition(int[] list, int first, int last) {

int pivot = list[first]; // pivot can be Choose as first element

int low = first + 1; // forward search index

int high = last; // backward search for index

while (high > low) {

// left Search forward

while (low <= high && list[low] <= pivot)

low++;

//right Search backward

while (low <= high && list[high] > pivot)
high--;

// Swaping two elements in the list

if (high > low) {

int temp = list[high];

list[high] = list[low];

list[low] = temp;

}
}

while (high > first && list[high] >= pivot)

high--;

// Swaping pivot with left high

if (pivot > list[high]) {

list[first] = list[high];

list[high] = pivot;

return high;

} else {

return first;

}

}


public static void heapSort(int[] list) {

// Creating Heap of integers

Heap<Integer> heap = new Heap<Integer>();

// Adding elements to heap

for (int i = 0; i < list.length; i++)

heap.add(list[i]);

// Removing elements from heap

for (int i = list.length - 1; i >= 0; i--)

list[i] = heap.remove();
}
static class Heap<E extends Comparable<E>> {

private java.util.ArrayList<E> list = new java.util.ArrayList<E>();

/** Creatinf the default heap */

public Heap() {
}

/** Creating heap from an array of objects */

public Heap(E[] objects) {

for (int i = 0; i < objects.length; i++)

add(objects[i]);
}

/** Adding new object into the heap */

public void add(E newObject) {

list.add(newObject); // Append to the heap

int currentIndex = list.size() - 1; // The index of the last node

while (currentIndex > 0) {

int parentIndex = (currentIndex - 1) / 2;

// have to Swap if current object is greater than of its parent

if (list.get(currentIndex).compareTo(list.get(parentIndex)) > 0) {

E temp = list.get(currentIndex);

list.set(currentIndex, list.get(parentIndex));

list.set(parentIndex, temp);

} else

break; // now the tree is a heap

currentIndex = parentIndex;
}
}

/** Removing root from the heap */

public E remove() {

if (list.size() == 0)

return null;

E removedObject = list.get(0);

list.set(0, list.get(list.size() - 1));

list.remove(list.size() - 1);

int currentIndex = 0;

while (currentIndex < list.size()) {

int leftChildIndex = 2 * currentIndex + 1;

int rightChildIndex = 2 * currentIndex + 2;

// Finding maximum between two children

if (leftChildIndex >= list.size())

break; // The tree is a heap

int maxIndex = leftChildIndex;

if (rightChildIndex < list.size()) {

if (list.get(maxIndex).compareTo(list.get(rightChildIndex)) < 0) {

maxIndex = rightChildIndex;
}
}

// have to Swap if the current node is less than that of the maximum

if (list.get(currentIndex).compareTo(list.get(maxIndex)) < 0) {

E temp = list.get(maxIndex);

list.set(maxIndex, list.get(currentIndex));

list.set(currentIndex, temp);

currentIndex = maxIndex;

} else

break; // now here the The tree is a heap

}

return removedObject;

}

/** here we can able to Get the number of nodes in tree */

public int getSize() {

return list.size();

}

}


static void radixSort(int[] list, int maxOrder) {

for (int order = 1; order < maxOrder; order *= 10) {

@SuppressWarnings("unchecked")

ArrayList<Integer>[] bucket = new ArrayList[10];

for (int i = 0; i < bucket.length; i++) {

bucket[i] = new java.util.ArrayList<>();

}

for (int i = 0; i < list.length; i++) {

bucket[(list[i] / order) % 10].add(list[i]);

}

int k = 0;

for (int i = 0; i < bucket.length; i++) {

if (bucket[i] != null) {

for (int j = 0; j < bucket[i].size(); j++)

list[k++] = bucket[i].get(j);
}
}
}
}

}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.