Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
35 changes: 35 additions & 0 deletions Bubble Sort/BubbleSort.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
//Implementing Bubble Sort

class BubbleSort {

static void bubbleSort(int arr[], int n) {
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;
}
}
}
}

static void printArray(int arr[], int size) {
for (int i = 0; i < size; i++)
System.out.print(arr[i] + " ");
System.out.println();
}

public static void main(String args[]) {
int arr[] = { 89, 15, 7, 25, 17, 4, 16 };
System.out.print("Array before sorting: ");
for(int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
int n = arr.length;
bubbleSort(arr, n);
System.out.print("Array after sorting: ");
printArray(arr, n);
}
}
37 changes: 37 additions & 0 deletions Shell Sort/ShellSort.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
//Implementation of ShellSort
class ShellSort {

int helper(int arr[], int n) {

for (int i = n/2; i > 0; i /= 2) {
for (int j = i; j < n; j += 1) {
int temp = arr[j];
int k;
for (k = j; k >= i && arr[k - i] > temp; k -= i)
arr[k] = arr[k - i];

arr[k] = temp;
}
}
return 0;
}

static void printArray(int arr[], int n) {
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}

public static void main(String args[]) {
int arr[] = {100, 25, 17, 34, 26};
int n = arr.length;
System.out.print("Array before sorting: ");
printArray(arr, n);

ShellSort SS = new ShellSort();
SS.helper(arr, n);

System.out.print("Array after sorting:");
printArray(arr, n);
}
}