bubble sorting algorithms code example
Example 1: bubble sort code
func Sort(arr []int) []int {
for i := 0; i < len(arr)-1; i++ {
for j := 0; j < len(arr)-i-1; j++ {
if arr[j] > arr[j+1] {
temp := arr[j]
arr[j] = arr[j+1]
arr[j+1] = temp
}
}
}
return arr
}
Example 2: bubble sort algorithm
#include <bits/stdc++.h>
using namespace std;
void bubbleSort(int arr[], int n){
int temp,i,j;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(arr[i] > arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
int main(){
int arr[] = {1,7,33,9,444,2,6,33,69,77,22,9,3,11,5,2,77,3};
int n = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, n);
for(int i=0;i<n;i++){
cout << arr[i] << " ";
}
return 0;
}
Example 3: Bubble Sort
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.StandardCharsets;
import java.util.StringTokenizer;
public class Day20_Sorting {
static int MB = 1 << 20;
static BufferedReader BR = new BufferedReader( new InputStreamReader(System.in, StandardCharsets.US_ASCII), 20 * MB);
static StringTokenizer st;
static String lastLine;
static void newLine() throws IOException {
lastLine = BR.readLine();
st = new StringTokenizer(lastLine);
}
public static void main(String[] args) throws IOException {
newLine();
int N = parseInt(st.nextToken());
newLine();
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = parseInt(st.nextToken());
}
int numberOfSwapps = bubbleSort(N, A);
int firstElement = A[0];
int lastElement = A[N-1];
print(numberOfSwapps, firstElement, lastElement);
}
private static void print(int numberOfSwapps, int firstElement, int lastElement) {
StringBuilder sb = new StringBuilder();
sb.append("Array is sorted in ").append(numberOfSwapps).append(" swaps.\n");
sb.append("First Element: ").append(firstElement).append('\n');
sb.append("Last Element: ").append(lastElement).append('\n');
System.out.print(sb);
}
private static int bubbleSort(int N, int[] A) {
int cnt = 0;
for (int i = 0; i < N; i++) {
int numberOfSwaps = 0;
for (int j = 0; j < N - 1; j++) {
if (A[j] > A[j + 1]) {
swap(A, j , j + 1);
numberOfSwaps++;
}
}
cnt += numberOfSwaps;
if (numberOfSwaps == 0) {
break;
}
}
return cnt;
}
private static void swap(int[] a, int i, int j) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}