Početna » Sinteza 2021 - International Scientific Conference on Information Technology and Data Related Research » Student Session
- Computer Science, Computational Methods, Algorithms and Artificial Intelligence
- Environmental Data Science Session
- Information Secuity and Advanced Engineeing Systems Session
- Information Systems, Software Development, Internet Technologies and Social Networking Session
- Internet Technologies and Applications in Education And Language Learning Session
- IT Applications in Sport Session
- Student Session
Algorithm for Sorting Non-Negative Integers
Abstract:
This paper presents an algorithm for sorting non-negative integers. The algorithm solves the sorting problem recursively. There are numerous sorting algorithms available today, however this paper suggests a different approach to solving this problem using a binary representation of integers. The paper graphically presents comparative tests that were executed with already existing sorting algorithms. The test results show in which situations it is best to use this algorithm. Possible further directions of development of this algorithm, as well as other algorithms that can use this approach to problem-solving, are also presented.
CITATION:
IEEE format
M. Savić, M. Živković, “Algorithm for Sorting Non-Negative Integers,” in Sinteza 2021 - International Scientific Conference on Information Technology and Data Related Research, Belgrade, Singidunum University, Serbia, 2021, pp. 328-332. doi:10.15308/Sinteza-2021-328-332
APA format
Savić, M., Živković, M. (2021). Algorithm for Sorting Non-Negative Integers. Paper presented at Sinteza 2021 - International Scientific Conference on Information Technology and Data Related Research. doi:10.15308/Sinteza-2021-328-332
BibTeX format
Download
RefWorks Tagged format
Download
