Bubble Sort

(JAVA) In Bubble sort the smaller values gradually "bubble" their way to the top of the array (first element). The technique uses nested loops to make several passes through the array. each pass compares successive pairs of elements. If the pair is in increasing order, sort leaves the values as they are. If the pair is in descending order, sort swaps the pair of values. First pass compares first and second elements, then compares second and third elements, swapping them as needed and so on until the last two elements are compared and swapped (if needed). After one pass the largest element will be at the end of the array. After two passes larges two elements will be in the last two positions.This is repeated until the array is sorted.

Implement the Bubble Sort for an array of integers. Ask the user to enter the SIZE (number of elements) of the array and generate random 2 digit integers in the range of 1 to 90 and place them in the array. Display the original array and the result of each pass on the console. The last pass the sorted array will be displayed.This is O(n*2) algorithm.