Add Some advance sorting algorithm

[Harshsaini001]

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.

[Harshsaini001]

I would like to request to be assigned the task of adding additional sorting algorithms to the project. Specifically, I plan to implement the following algorithms:

Flash Sort

Library Sort

I will also include feature descriptions, example usage, and Python implementations consistent with the existing codebase style.

Kindly assign this enhancement task to me so I can start working on it.