Skip to content

Latest commit

 

History

History
23 lines (10 loc) · 1.21 KB

README.md

File metadata and controls

23 lines (10 loc) · 1.21 KB

Comparing Interpreter's execution time

In this repository, I will be comparing Ç♭'s performance against against several other interpreted languages, including Python, Java, JavaScript (Node), Bash, and Ruby.

I will implement two algorithms in each language:

The first algorithm will sort an array of numbers in ascending order using the insertion sort method.

And the second one will calculate the mode between the numbers within the array.

To evaluate the performance of each programming language, I will execute each algorithm ten times and compute the average and the standard deviation of execution times. This data will then be used to create two comparative graphs.

NB: Some of the languages included in this comparison, such as Java and JavaScript, are not strictly interpreted. Instead, they utilize JIT (Just in Time) Compilation, which means that while most of the code is interpreted, performance-intensive tasks, such as loops, are directly compiled into machine code.

first_graph

second_graph

It is important to remember that all of those tests have been carried out in the same ASUSTeK COMPUTER INC. Vivobook_ASUSLaptop X1605ZA_X1605ZA with Debian 12.7.