Done some measurements about the performance of various implementations of QuickSort and MergeSort.
This one is about the time it takes to sort a randomly-generated (and, therefore, randomly shuffled) array of certain size:
![[Image: output_of_tester1_as_a_diagram.png]](https://github.com/FlatAssembler/ArithmeticExpressionCompiler/raw/master/MergeSort/TestResults/output_of_tester1_as_a_diagram.png)
This one is about the time it takes to sort an array of certain sortedness, all of the arrays being of the same size:
This one is about the time it takes to sort a randomly-generated (and, therefore, randomly shuffled) array of certain size:
![[Image: output_of_tester1_as_a_diagram.png]](https://github.com/FlatAssembler/ArithmeticExpressionCompiler/raw/master/MergeSort/TestResults/output_of_tester1_as_a_diagram.png)
This one is about the time it takes to sort an array of certain sortedness, all of the arrays being of the same size:
![[Image: output_of_tester2_as_a_diagram.png]](https://github.com/FlatAssembler/ArithmeticExpressionCompiler/raw/master/MergeSort/TestResults/output_of_tester2_as_a_diagram.png)