Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language

Abstract

Computer Science is all about the solving problems with the help of algorithms and sorting is one of the basic operations for any problem solving method. In sorting, the arrangement of data or objects in any particular order is done with the help of algorithms. There is more than one method available and also includes a wide range of choices in a programming language. These languages serve a different purpose in their field of the area but some can be used interchangeably for the same purpose especially for a server-side language like JavaScript can also implement for server-side tasks and right now it is being widely used all over the internet. Here this paper analyzed these languages with merge sort and bubble sort with the languages of the latest public stable versions for an idea of the performance of these languages because they are pretty much interchangeable for different uses in the market the only difference these server side languages have is their architecture. This paper compared these languages’ capabilities with merge sort and bubble sort by executing them and observing them in terms of time by giving them different numbers of inputs. Analytics used an array of 2500, 5000, 7500, and 10000 lengths of an array that passes through these algorithms and noted the execution time to get a better idea of the capabilities of these languages. With this method, observes that in the latest public version of all languages python performs faster in merge sort while JavaScript performs better in bubble sort in executing 10000 inputs.