PixSorter

Find the correct position of a pivot point in the pixel array (i.e. all values before are lower, all following are higher), then divide the array at that point. Repeat until the subarrays are so small that moving the pivot sorts them.

Avg. time: O(n log(n)) | Avg. Space: O(n log(n))

Find the correct position of a pivot point in the pixel array (i.e. all values before are lower, all following are higher), then divide the array at that point. Repeat until the subarrays are so small that moving the pivot sorts them.

Avg. time: O(n log(n)) | Avg. Space: O(n log(n))

Start at the beginning. Check if the next value in the pixel array is lower: if so, swap with the current pixel; if not, don't. Move to the next value until the largest number is last. Repeat, stopping one index earlier.

Avg. time: O(n²) | Avg. Space: O(1)

Iterate through the pixel array in reverse, swapping lower value pixels to their correct place at the start of the array. This creates a sorted section which grows with each loop through the pixel array.

Avg. time: O(n²) | Avg. Space: O(1)

Loop through the pixel array to find the lowest value and then move it into the first position. Find the next lowest and move it into position two. Repeat until reaching the end of the array.

Avg. time: O(n²) | Avg. Space: O(1)

Adding Red, Green & Blue pixel values

Using the Red pixel value

Using the Green pixel value

Using the Blue pixel value