sort-algorithms-with-java

A code collection of popular sort algorithms coded using java

Description:

This repository contains the java source codes that were written during my practice of implementing various sort algorithms from scratch using Java. This repo might be helpful for anyone who needs a quick refresher on popular sorting algorithms and their implementation during their preparation for a technical interview or an examination.

Steps To Compile & Run:

1. From the project's root directory, compile the Utility.java file.

      javac helperUtils/Utility.java
   

2. Then compile the required sort algorithm java code from the root of the project.

   For example to compile the bubble sort code:

      javac sortAlgorithms/BubbleSort.java
   

3. Run the compiled code using the java command.

   For example, to run the bubble sort code compiled from the above step:

      java sortAlgorithms/BubbleSort
   

Contents:

1. Bubble Sort:

Worst case time complexity:

O(n^2)

Sort Type:

Stable Sort

---

2. Selection Sort:

Worst case time complexity:

O(n^2)

Sort Type:

Unstable Sort

---

3. Insertion Sort:

Worst case time complexity:

O(n^2)

Sort Type:

Stable Sort

---

4. Shell Sort:

Worst case time complexity:

O(n^2) - Depends on how the Shell interval is selected.

Sort Type:

Unstable Sort

---

5. Merge Sort:

Worst case time complexity:

O(n logn)

Sort Type:

Stable Sort

---

6. Quick Sort:

Worst case time complexity:

O(n logn)

Sort Type:

Unstable Sort

---

7. Counting Sort:

Worst case time complexity:

O(n)

Sort Type:

Stable Sort

---