Implimentation Of Table_Track_Sort() Algorithm Which Classifies the Elements of an Array in Known Order. Further Examining the Time Complexity and Space Complexity of an Algorithm and Analysing the Efficacy of the Algorithm - A Case Study.

ABSTRACT In the field of computer science, the efficiency of a program solely depends on the time factor of processing a statement or block of statements. Further, the amount of memory it uses for processing also matters in calculating the space complexity of the program. There are numerous sorting techniques that exist; each one has pros and cons, and these sorting techniques are used in the development of software. The table_track sorting algorithm is a unique method to sort the elements of a given list of numbers. This manuscript implements the function table_track_sort(), which uses a matrix table to sort a list of numbers further. It examines the execution of the methodology with respect to time complexity and space complexity of the algorithm. Keywords: Table Track Sort (TTS), Matrix Table(MT), Number (N), Compared Number Position(CNP), Original Number Position (ONP), Original And Compared Number Result (OCR).