BubbleSort.java

/**
* Bubble sort algorithm.
* Time complexity: O(n*n)
* Space complexity: O(1)
*/
static int[] bubbleSort(int[] A) {
  for (int i = 0; i < A.length; i++) {
    for (int j = 0; j < A.length - 1 ; j++) {
      if (A[j] > A[j + 1]) {
        int temp = A[j + 1];
        A[j + 1] = A[j];
        A[j] = temp;
      }
    }
  }
  return A;
}

InsertionSort.java

/**
* Insertion sort algorithm.
* Time complexity: O(n*n) 
* Space complexity: O(1)
*/
static int[] insertionSort(int[] A) {
  for(int i = 0; i < A.length; i++) {
    int k = A[i];
    int j = i - 1;
    while((j > -1) && (A[j] > k)) {
      A[j + 1] = A[j];
      j--;
    }
    A[j + 1] = k;
  }
  return A;
}