A Comparison With Five Java Sorting Algorithms for Ubuntu and Seven 32 Bits Operating Systems.
Saved in:
| Title: | A Comparison With Five Java Sorting Algorithms for Ubuntu and Seven 32 Bits Operating Systems. |
|---|---|
| Authors: | Gualter, Ana, Negreiros, João |
| Source: | International Journal of Advanced Research in Computer Science; Mar/Apr2012, Vol. 3 Issue 2, p73-77, 5p |
| Subject Terms: | ALGORITHMS, LINUX operating systems, JAVA programming language, COMPILERS (Computer programs) |
| Reviews & Products: | MICROSOFT Windows (Operating system) |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Advanced Research in Computer Science is the property of International Journal of Advanced Research in Computer Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!