Function algorithm_lower_bound

algorithm/algorithm.c:891–911

* @brief Finds the first position in a sorted range where a value can be inserted without violating the order. * * This function performs a binary search on a sorted range `[base, base + num * size)` to find the first * position where `val` can be inserted while maintaining the sorted order. The range must be sorted * according to the same comparison function `comp`. * * @param base Pointer

 * @return Pointer to the first position where `val` can be inserted without violating the order.
 */
void *algorithm_lower_bound(const void *base, size_t num, size_t size, const void *val, CompareFunc comp) {
    ALGORITHM_LOG("[algorithm_lower_bound] Info: Performing lower bound search in array of %zu elements.", num);

    size_t low = 0;
    size_t high = num;

    while (low < high) {
        size_t mid = low + (high - low) / 2;
        const void *mid_elem = (const char *)base + mid * size;

        if (comp(mid_elem, val) < 0) {
            low = mid + 1;
        } 
        else {
            high = mid;
        }
    }

    ALGORITHM_LOG("[algorithm_lower_bound] Success: Found lower bound at index %zu.", low);
    return (void *)((const char *)base + low * size);
}


/**