SortingAlgorithm

enum class MayaFlux::Yantra::SortingAlgorithm : uint8_t

strong

Available sorting algorithms for different use cases.

Enumerator
STANDARD	std::sort with comparator
STABLE	std::stable_sort for equal element preservation
PARTIAL	std::partial_sort for top-K selection
NTH_ELEMENT	std::nth_element for median/percentile
HEAP	Heap sort for memory-constrained scenarios.
PARALLEL	Parallel sorting (std::execution::par_unseq)
RADIX	Radix sort for integer types.
COUNTING	Counting sort for limited range integers.
BUCKET	Bucket sort for floating point.
MERGE_EXTERNAL	External merge sort for large datasets.
QUICK_OPTIMIZED	Optimized quicksort with hybrid pivot selection.
LAZY_STREAMING	Lazy evaluation with coroutines (Vruta/Kriya)
PREDICTIVE_ML	Machine learning based predictive sorting.
EIGEN_OPTIMIZED	Eigen-specific mathematical sorting.
GPU_ACCELERATED	GPU-based sorting (future Vulkan integration)

Definition at line 29 of file SortingHelper.hpp.

                            : uint8_t {
    STANDARD, ///< std::sort with comparator
    STABLE, ///< std::stable_sort for equal element preservation
    PARTIAL, ///< std::partial_sort for top-K selection
    NTH_ELEMENT, ///< std::nth_element for median/percentile
    HEAP, ///< Heap sort for memory-constrained scenarios
    PARALLEL, ///< Parallel sorting (std::execution::par_unseq)
    RADIX, ///< Radix sort for integer types
    COUNTING, ///< Counting sort for limited range integers
    BUCKET, ///< Bucket sort for floating point
    MERGE_EXTERNAL, ///< External merge sort for large datasets
    QUICK_OPTIMIZED, ///< Optimized quicksort with hybrid pivot selection
    // Future algorithms for coroutine integration
    LAZY_STREAMING, ///< Lazy evaluation with coroutines (Vruta/Kriya)
    PREDICTIVE_ML, ///< Machine learning based predictive sorting
    EIGEN_OPTIMIZED, ///< Eigen-specific mathematical sorting
    GPU_ACCELERATED ///< GPU-based sorting (future Vulkan integration)
};