Why Floor and Ceil in Sorted Array in DSA Go?

The Big Idea

Discover how to find the closest match in a sorted list instantly without checking every item!

The Scenario

Imagine you have a sorted list of prices for products, and you want to find the closest price that is just less than or equal to a customer's budget (floor), or the closest price that is just greater than or equal to it (ceil). Doing this by checking each price one by one is slow and tiring.

The Problem

Manually scanning through the list means looking at every price until you find the right one. This takes a lot of time if the list is long. It is easy to make mistakes, like missing the closest price or stopping too early.

The Solution

Using the floor and ceil concept with a sorted array lets you quickly jump to the right price without checking all of them. This saves time and avoids errors by using a smart search method.

Before vs After

✗ Before

for i := 0; i < len(prices); i++ {
    if prices[i] <= budget {
        floor = prices[i]
    }
}

✓ After

floor := findFloor(prices, budget)
ceil := findCeil(prices, budget)

What It Enables

This concept enables fast and accurate searching for closest values in sorted data, making programs efficient and reliable.

Real Life Example

When booking flights, you want to find the cheapest ticket just below your budget or the next available ticket price just above it. Floor and ceil help find these prices quickly.

Key Takeaways

Manual search is slow and error-prone for large sorted lists.

Floor and ceil use smart searching to find closest smaller or larger values fast.

This makes programs efficient and helps in real-world tasks like price or date searching.