Feature description

1.Flash Sort

Type: Distribution-based

Features: Uses classification into buckets and permutation cycles. Very fast for uniformly distributed numbers.

Use Case: Numeric datasets with uniform distribution.

2. Library Sort

Type: Insertion-based, Gap-assisted

Features: Uses gaps to accelerate insertions. Adaptive and faster than standard insertion sort for large arrays.

Use Case: Dynamic datasets where elements are inserted over time.