Arisha Naz et al., International Journal of Advanced Trends in Computer Science and Engineering, 10(3), May - June 2021, 2249 – 2255 2249 ABSTRACT Sorting algorithm deals with the arrangement of alphanumeric data in static order. It plays an important role in the 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. Key words: Selection Sort, Time Complexity, Algorithm Implementation, C/C++, Python, Rust, Comparison. 1. INTRODUCTION Selection sort is an algorithm used for sorting easily it is very simple, it divide the list into two parts and do sort the problem in a way that right part contain unsorted numbers and left part contain sorted number similarly it revolves over files in the cluster; for each file, selection sort calls minimum record and line of work. In the event that the length of the exhibit is n, there are n files in the cluster. Hence each outcome of the body of the program runs code of two lines. It may feel that two n, number lines of program are debugged by selection sort. However, a few lines of code are executed on recollected record in minimum [1]. At the point when given selection of unsorted information, the calculation was partition the rundown into two sections: one section that has all the sorted information and another part that has all the staying unsorted information. At the point when the calculation initial beginnings, there is no information in the initial segment neither in sorted order at this point and all the unsorted information is in the subsequent part. The calculation at that point begins to locate the smallest element in the unsorted information and trade it with the furthest is to be the left component of the run down. The part with the sorted information is then the furthest is the left component and the part with the unsorted information is to be the staying unsorted components. The calculation rehashes itself, by finding the smallest component inside the rundown of unsorted information and trading it with the furthest left component, in the end setting everything straight information [2]. 1.1 Selection Sort Algorithm Working  Find the lowest number.  Move it with the initial value.  Find the second lowest number.  Move it with the second value.  Find the third-lowest number  Move it with the third value.  Repeat finding the next lowest value, and moving it into the correct place until the array is sorted 1.2 Selection Sort Complexity Selection sort isn't hard to investigate contrasted with other sorting techniques since none of the replacement relies upon the information in the cluster. Choosing the base requires checking n components and afterward exchanges it in to the primary position. Finding the following most reduced components requires examining the remaining n-1 is the components, etc. Hence, the absolute number of the correlations is regarding number of correlations. Every one of these steps requires one swap for n-1 is components [3]. Implementation of Selection Sort Algorithm in Various Programming Languages Arisha Naz 1 , Haque Nawaz 2 , Abdullah Maitlo 3 , Syed Muhammad Hassan 4 1 BSCS Student, Department of Computer Science, Sindh Madressatul Islam University, Karachi, Sindh, Pakistan, arisha.naz1234@gmail.com 2 Department of Computer Science, Sindh Madressatul Islam University, Karachi, Sindh, Pakistan, hnlashari@smiu.edu.pk 3 Department of Computer Science, Shah Abdul Latif University, Khairpur Mirs, Sindh, Pakistan, abdullah.maitlo@salu.edu.pk 4 Department of Computer Science, Sindh Madressatul Islam University, Karachi, Sindh, Pakistan, m.hassan@smiu.edu.pk ISSN 2278-3091 Volume 10, No.3, May - June 2021 International Journal of Advanced Trends in Computer Science and Engineering Available Online at http://www.warse.org/IJATCSE/static/pdf/file/ijatcse1061032021.pdf https://doi.org/10.30534/ijatcse/2021/1071032021