Sorting.java

import java.util.*;
public class Sorting {

    // bubble sort
    public static void bubblesort(int arr[]){
         for( int turn=0; turn<arr.length-1;turn++){
            for(int j = 0; j<arr.length-1-turn;j++){
                if(arr[j]<arr[j+1]){
                    int temp = arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=temp; 
                }
            }

         }
    }
    public static void printarr(int arr[]){
        for(int i =0 ; i<arr.length;i++){
          System.out.print(arr[i]+"");
        }
        System.out.println();
    }


    // Selection sort 
    public static void selectionsort(int[] arr){
        for(int i =0;i<arr.length-1 ;i++){
            int smallest = i;
            for(int j = i+1;j<arr.length;j++){
                if(arr[smallest]>arr[j]){
                    smallest= j;
                }
            }
            // swap
            int temp = arr[smallest];
            arr[smallest]=arr[i];
            arr[i]=temp;

        }
    }

    // insertion sort
     public static void insertionsort(int[ ]arr){
        for(int i =0;i<arr.length-1 ;i++){
            int curr = arr[i]; // temp memory to store current 
            int prev = i-1;
            // finding out to correct pos to insert
            while(prev>=0 && arr[prev]>arr[curr]){
                arr[prev+1]=arr[prev];
                prev--;
            }
            // insertion
            arr[prev+1]=arr[curr];
        }
     }
    public static void main(String[] args) {
        int arr[] = {5,4,1,3,2};
        // Arrays.sort(arr); //inbuilt sort
        //  
        printarr(arr);
    }
}