Pancake Sort Visualization

DESCRIPTION

Pancake Sort is a **comparison-based sorting algorithm** that sorts an array by repeatedly flipping (reversing) the order of its elements, similar to flipping pancakes in a stack.

The algorithm works by finding the largest unsorted element and flipping it to the top of the stack. Then, it flips the entire unsorted portion of the array to place the largest element in its correct position. This process repeats until the array is completely sorted.

Pancake Sort has a **worst-case and average time complexity of O(n²)**, making it inefficient for large datasets. However, it is useful in scenarios where only a restricted set of operations (flips) is allowed.

One advantage of Pancake Sort is that it operates **in-place**, requiring no extra memory. Additionally, it provides an interesting approach to sorting where only **prefix reversals** are allowed, making it a topic of study in theoretical computer science.

While Pancake Sort is not commonly used in practical applications, it is useful for educational purposes, theoretical research, and scenarios where flip-based sorting is required.