ShankarYoda / CppAlgorithms

Hactoberfest-2022
8 stars 39 forks source link

refined and optimized version of your Timsort implementation #57

Open Anshuman7080 opened 1 month ago

Anshuman7080 commented 1 month ago

Memory Management: Used dynamic memory allocation for temporary arrays in the merge function, ensuring flexibility and avoiding stack overflow for large arrays. Simplified Logic: Removed unnecessary variables and streamlined the code for readability. Cleaner Insertion Sort: The insertion sort logic was refined to ensure it operates within the specified bounds. Consistent Naming: Ensured that variable names are clear and meaningful, improving readability. Improved Output: Added formatting in the output to make it clearer.