Skip to content

Added Bubble sort, Merge sort, Quick sort and Selection sort implementations #11

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added Bubble sort, Merge sort, Quick sort and Selection sort implementations #11

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions Sorting algorithms/BubbleSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
class BubbleSort {
private static void sort(int arr[]) {
int n = arr.length;
for (int i = 0 ; i < n - 1 ; i++) {
for (int j = 0 ; j < n - i - 1 ; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}

public static void main(String args[]) {
int arr[] = {64, 25, 12, 22, 11};
System.out.println("Original array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println("\n");
sort(arr);
System.out.println("Sorted array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println();
}
}
68 changes: 68 additions & 0 deletions Sorting algorithms/MergeSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,68 @@
class MergeSort {
private static void merge(int arr[], int l, int m, int r) {
int n1 = m - l + 1;
int n2 = r - m;

int L[] = new int [n1];
int R[] = new int [n2];

for (int i = 0 ; i < n1 ; ++i) {
L[i] = arr[l + i];
}
for (int j = 0 ; j < n2 ; ++j) {
R[j] = arr[m + 1+ j];
}

int i = 0, j = 0;
int k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}

while (i < n1) {
arr[k] = L[i];
i++;
k++;
}

while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}

private static void sort(int arr[], int l, int r) {
if (l < r) {
int m = (l+r)/2;

sort(arr, l, m);
sort(arr , m+1, r);
merge(arr, l, m, r);
}
}

public static void main(String args[]) {
int arr[] = {64, 25, 12, 22, 11};

System.out.println("Original Array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println("\n");
sort(arr, 0, arr.length-1);
System.out.println("Sorted array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println();
}
}
46 changes: 46 additions & 0 deletions Sorting algorithms/QuickSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
class QuickSort {
private static int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low ; j < high ; j++) {
if (arr[j] <= pivot) {
i++;
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}

int temp = arr[i + 1];
arr[i + 1] = arr[high];
arr[high] = temp;

return i + 1;
}

private static void sort(int arr[], int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);

sort(arr, low, pi - 1);
sort(arr, pi + 1, high);
}
}

public static void main(String args[]) {
int arr[] = {64, 25, 12, 22, 11};
int n = arr.length;

System.out.println("Original Array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println("\n");
sort(arr, 0, n-1);
System.out.println("Sorted array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println();
}
}
33 changes: 33 additions & 0 deletions Sorting algorithms/SelectionSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
public class SelectionSort {
private static void sort(int arr[]) {
int n = arr.length;

for (int i = 0 ; i < n - 1 ; i++) {
int minIndex = i;
for (int j = i + 1 ; j < n ; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}

int temp = arr[minIndex];
arr[minIndex] = arr[i];
arr[i] = temp;
}
}

public static void main(String args[]) {
int arr[] = {64, 25, 12, 22, 11};
System.out.println("Original array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println("\n");
sort(arr);
System.out.println("Sorted array");
for (Integer i : arr) {
System.out.print(i + " ");
}
System.out.println();
}
}