A Comparison With Five Java Sorting Algorithms for Ubuntu and Seven 32 Bits Operating Systems

Abstract

The aim of an algorithm is to resolve a specific problem based on a predefined set of individuals steps. In this article, we intend to use five sorting algorithms (Merge, Insertion, Bubble, Quick and Heap) as a tool for performance comparison between two 32 bits operating systems (Ubuntu® Linux and Windows® 7 Ultimate) and, implicitly, their Java compilers (BlueJ® environment). Analogous, we introduce the state-of-the-art on logarithmic complexity, present Java sort algorithms for both operating systems (OS) and display our results experiments.

Keywords: Linux Ubuntu®, Windows® 7, Benchmark, Java Sorting Algorithms.