Did I correctly translate this pseudocode into Java? I'm particularly looking at line 3 in the pseudocode for this sorting algorithm
Yes, but there is one mistake. In the pseudocode you start with i = 1, because in pseudocode we dont start counting at 0. in your programm you have to start at 0, because the first element of an array start at array[0], not array[1].
Line #3 translated correctly but that's not actually a bubble sort algorithm. Here if (array[j] > array[i]) you compare all the further elements with i element and in bubble sort you need to compare only neighbor elements of array. So, basically to transform it to bubble sort you need to compare j with j-1