geekific-youtube VS sortingVisualization

link: https://github.com/geekific-official/geekific-youtube/blob/main/tree-avl/src/main/java/com/youtube/geekific/AVLTree.java, line 177.

It is pretty simple: Let's say: W = image width H = image height The image is splitted in a 1D array HxW long, called p. Each pixel has inside itself stored its initial position. We start from the top-left corner, defining that pixel as the origin (coordinate = {x=0,y=0} ). We'll move in the right direction, incresing the x coordinate, until we get to the top-right corner (where the x coordinates will be {x = W-1, y=0}). Finally, we'llrestart from the left border, a pixel down from the corner, where we'll have {x=0, y=1}. Using this method, the position of a pixel inside the array will be equal to : pos = (y_coord * n_rows + x_coord). In the sorting algorithms we implemented, the comparisons between pixels are done by comparing the initial position of the pixel which, I said earlier, is stored inside the pixel itself. This is the core logic of the project which is consultable at the [project github page](https://github.com/mattiamonari/sortingVisualization)