Implementation of Selection Sort Algorithm in Various Programming Languages

Sorting algorithm deals with the arrangement of alphanumeric data in static order. It plays an important role in he field of data science. Selection sort is one of the simplest and efficient algorithms which can be applied for the huge number of elements it works like by giving list of unsorted information, the calculation which breaks into two partitions. One section has all the sorted information and another section has all the staying unsorted information. The calculation rehashes itself, by finding the smallest component inside the rundown of unsorted information and swapping it with the furthest left component, in the end setting everything straight information. This research presents the implementation of selection sort using C/C++, Python, and Rust and measured the time complexity. After experiment, we have collected the results in terms of running time, and analyzed the outcomes. It was observed that python language has very small amount of line of code, and it also consumes less storage and fast running time then other two languages.