Skip to content

Instantly share code, notes, and snippets.

@prabhatkashyap
Created November 18, 2017 15:50
Show Gist options
  • Save prabhatkashyap/f2d834b17d09789fa5c44be96d9d2992 to your computer and use it in GitHub Desktop.
Save prabhatkashyap/f2d834b17d09789fa5c44be96d9d2992 to your computer and use it in GitHub Desktop.
// Java program for implementation of Bubble Sort
class BubbleSort
{
void bubbleSort(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])
{
// swap temp and arr[i]
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
/* Prints the array */
void printArray(int arr[])
{
int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver method to test above
public static void main(String args[])
{
BubbleSort ob = new BubbleSort();
int arr[] = {64, 34, 25, 12, 22, 11, 90};
ob.bubbleSort(arr);
System.out.println("Sorted array");
ob.printArray(arr);
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment