Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Visual Sorting: Visual Paradigm Implementation for Tree-based Sorting Algorithm

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2021
Achmad Ginanjar

Achmad Ginanjar. Visual Sorting: Visual Paradigm Implementation for Tree-based Sorting Algorithm. International Journal of Computer Applications 183(18):31-34, July 2021. BibTeX

	author = {Achmad Ginanjar},
	title = {Visual Sorting: Visual Paradigm Implementation for Tree-based Sorting Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {July 2021},
	volume = {183},
	number = {18},
	month = {Jul},
	year = {2021},
	issn = {0975-8887},
	pages = {31-34},
	numpages = {4},
	url = {},
	doi = {10.5120/ijca2021921506},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


In the world of sorting algorithms, the visual interpretation approach has not been explored yet. In the attempt at this approach, this paper will explore an algorithm that uses object unit values for sorting purpose. Those unit values represent how visual interpretation understanding an integer. The unit values were taken from an integer and split into values of unit, ten, hundred, etc. The integer was processed from a list of integers. Those integers in the list then sorted. The sorting process was done in two steps. The two processes are similar to the concept of divide and conquer in other sorting algorithm but having different logic. The results were shown to be accurate and stable. The result also indicated that the process could be done parallel. This indicates that the visual interpretation approach can be used as a sorting algorithm with the possibility of parallel execution.


  1. Zhang, Jian & Jin, Rui. (2021). An Improved Bubble Sort Method - Marking Bubble Sort. 10.1007/978-3-030-70042-3_121.
  2. Liu, Yu-Zhe & Tang, Shyue-Ming & Chang, Jou-ming. (2021). On the Decycling Number of Bubble-sort Star Graphs.
  3. Akhter, Naeem & Idrees, Muhammad & Furqan-ur-Rehman,. (2016). Sorting Algorithms – A Comparative Study. International Journal of Computer Science and Information Security,. 14. 930-936.
  4. Skiena, S. S. (2008). 4.5: Mergesort: Sorting by Divide-and-Conquer. In The Algorithm Design Manual (2nd ed.) (pp. 120-125). Springer.
  5. Sklyarov, V., Skliarova, I., & Pimentel, B. (2005). PGA-based implementation and comparison of recursive and iterative algorithms.
  6. Sutherland, I. E. (1938). Sketchpad, a man-machine graphical communication system. Massachusetts Institute of Technology.


Tree sorting, visual paradigm, python sorting, integer sorting, tree object, time complexity, OOP