Function algorithm_next_permutation

algorithm/algorithm.c:1101–1135

* @brief Generates the next lexicographical permutation of a range. * * This function rearranges the elements in the range `[first, last)` into the next lexicographical * permutation, as determined by the comparison function `comp`. If such a permutation is not possible, * the range is rearranged into the smallest lexicographical order (sorted in ascending order). * * @param first Pointer to

 * @return `true` if the next permutation was generated, `false` if the range was reset to the smallest permutation.
 */
bool algorithm_next_permutation(void *first, void *last, size_t size, CompareFuncBool comp) {
    ALGORITHM_LOG("[algorithm_next_permutation] Info: Generating next permutation.");
    if (first == last) {
        ALGORITHM_LOG("[algorithm_next_permutation] Warning: Empty range, returning false.");
        return false;
    }

    char *i = (char *)last - size;
    while (i != (char *)first) {
        char *j = i;
        i -= size;

        if (comp(i, j)) {
            char *k = (char *)last - size;
            while (!comp(i, k)) {
                k -= size;
            }

            ALGORITHM_LOG("[algorithm_next_permutation] Info: Swapping elements.");
            swap(i, k, size);
            reverse(j, last, size);

            ALGORITHM_LOG("[algorithm_next_permutation] Success: Next permutation generated.");
            return true;
        }

        if (i == (char *)first) {
            ALGORITHM_LOG("[algorithm_next_permutation] Info: Resetting to smallest permutation.");
            reverse(first, last, size);
            return false;
        }
    }

    return false; 
}


/**