Bubble Sort in Java

BubbleSort.java

// Worste case is n^2 best case is n;
public static void BubbleSort(int[] array)
{
  int j;
  boolean flag = true;
  int temp;
  
  while(flag) {
    flag = false;
    for(j = 0; j < num.lenght - 1; j++) {
      temp = num[j];
      num[j] = num[j + 1];
      num[j + 1] = temp;
      flag = true;
    }
  }
}