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.

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