Performances of Sorting Algorithms in Popular Programming Languages

In modern days we see disciplines like data sciences, data Analytics, and machine learning are emerging to promote Information Technology and in bringing up Internet of things. Algorithms like sorting and searching plays a important role, as efficient sorting with searching is important for other algorithms. The emerging areas are using Python and Java languages for its implementation and have become most popular ones than C and C++. Also it is seen less asymptotic analysis is made on popular sorting algorithms using Python and Java. Sufficient asymptotic analysis and results using C/C++ are seen in research articles. This paper makes performance measures by implementing Popular Sorting Algorithms(PSAs) using Java, Python and C++ languages. We conducted our experiments on random data to make average case analysis and on ordered data to make worst case analysis. Our results have shown Merge sort performing well for Python implementation than Quick sort. Quick sort remains excellent in performance for Java implementation for random data. C++ implementation verified the behaviors of PSAs. Finally, we have indicated the miss behaviors made by Java and Python as observed in the results.