DSA Day 10/100

Topic: Sorting

Questions Successfully Completed: 2

Insertion Sort

Time Complexity : O(n2)

Space Complexity : O(1)

 static void insert(int arr[],int i)
  {
       int key = arr[i];
        int j = i-1;
        while (j>=0 && key<arr[j]){
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1]=key;
  }
  public void insertionSort(int arr[], int n)
  {
       for(int i=1;i<n;i++){
            insert(arr,i);
        }
  }

Selection Sort

Time Complexity : O(n2)

Space Complexity : O(1)

public static void selection(int[] arr, int n){
        int k=0;
        for(int i=0;i<n-1;i++){ // n-1 because in last pass last element will already be sorted.
            k=i;
            for(int j=i+1;j<n;j++){
                if(arr[j]<arr[k]){
                    k=j;
                }
            }
            int temp = arr[i];
            arr[i] = arr[k];
            arr[k] = temp;
        }
        System.out.println(Arrays.toString(arr));
    }

    public static void main(String[] args) {
        int[] arr = {8,5,3,1,9};
        selection(arr,arr.length);
    }

Thank you for Reading! :)