Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. The problem with bubble sort is its worst case scenario. When the smallest element is in the last position, then it takes more time to sort in ascending order, but takes less time to sort in descending order.An array is called beautiful if all the elements of the array are in either ascending or descending order. Given an array of numbers, find the minimum swap operations required to make the array beautiful.

The problem you've described is a classic computer science problem that can be solved using the Bubble Sort algorithm. Here's a step-by-step guide on how to solve it:

1. Initialize a variable swapCount to 0. This will keep track of the number of swaps we need to make to sort the array.

2. Start a loop that will go through each element of the array. This loop will be responsible for "bubbling up" the smallest element to its correct position.

3. Inside this loop, start another loop that will go from the beginning of the array to the end of the unsorted part of the array. This loop will be responsible for comparing each pair of elements and swapping them if they are in the wrong order.

4. If at any point you have to swap two elements, increment swapCount by 1.

5. After the inner loop finishes, the smallest element should be in its correct position. Now, the unsorted part of the array is everything except the last element, so you can reduce the size of the unsorted part by 1.

6. Repeat steps 2-5 until the array is sorted.

7. Finally, swapCount will be the minimum number of swap operations required to make the array beautiful.

This algorithm works because Bubble Sort guarantees that after each pass through the array, the smallest element in the unsorted part will be in its correct position. Therefore, the number of swaps it makes is the minimum number of swaps needed to sort the array.

Note: This algorithm assumes that the array should