This code defines a function called ruby_bbl_sort which takes an array as input and sorts it in ascending order using the Bubble Sort algorithm. The function begins by initializing a variable i to 0, and then enters a for loop that runs while i is less than the length of the input array arr. In each iteration of the outer loop, another for loop is entered, with a variable j initialized to 0. The inner loop runs while j is less than the difference between the length of the array arr and the current value of i, minus 1. This means that in each iteration of the outer loop, the inner loop will compare one less element at the end of the array, because the largest element has already been sorted in the previous iteration. Within the inner loop, the algorithm compares the jth element of the array with the j+1th element of the array. If the jth element is greater than the j+1th element, it swaps their positions in the array using a temporary variable temp. This process continues until the end of the inner loop is reached. Once both loops have completed, the sorted array is output to the console using the puts method. In summary, this code implements the Bubble Sort algorithm to sort an input array in ascending order using the Ruby programming language.

This code defines a function called ruby_quick_sort which takes an array as input and sorts it in ascending order using the Quick Sort algorithm. The function first checks whether the input array has a length of 1 or less. If so, it simply returns the input array as it is already sorted. If the input array has a length greater than 1, the function selects the first element in the array as the pivot. It then initializes two empty arrays, left_arr and right_arr. Next, the function enters a for loop that iterates over the remaining elements in the input array (i.e. starting from index 1), and adds each element to the left_arr if it is less than the pivot, or to the right_arr if it is greater than or equal to the pivot. Once the for loop has completed, the function recursively calls itself on the left_arr and right_arr, and concatenates the result with the pivot element. This process continues until the entire array has been sorted. In summary, this code implements the Quick Sort algorithm to sort an input array in ascending order by recursively dividing the input array into subarrays based on a pivot element, and then merging the subarrays back together in sorted order using the Ruby programming language.