GitHub - lelMike/Insertion-sort-using-files: Operating at O(nlogn), it efficiently sorts elements by storing them in text files and utilizes a FIFO-style structure. The sorting process is accelerated by dividing sorted sequences into temporary files as it goes. Imput file needs each number on newline.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
main.cpp		main.cpp

About

Operating at O(nlogn), it efficiently sorts elements by storing them in text files and utilizes a FIFO-style structure. The sorting process is accelerated by dividing sorted sequences into temporary files as it goes. Imput file needs each number on newline.