Confused as to how I could implement a sorting algorithm in Processing

[quark]

@Xevion

This worked fine, but only for bubble sort. And it seemed to be limited by the fact that if I wanted a different algorithm, I would need checks for what ‘stage’ of the algorithm I’m at, and if I wanted a different array, if I wanted to be able to ‘rewind’ or ‘pause’ I would encounter problems, making the whole process super difficult to maintain.

@Xevion

I kind of wish I was just able to do a draw tick while inside of a loop, being able to just call display(), sleep 0.01 seconds and then the loop continues, but unfortunately, no such thing.

This has been discussed before so you might read this discussion

Most sort algorithms have two key activities

1. Compare two elements in the collection to sort
2. Swap two elements in the collection if in the wrong order.

One possible solution is to remember the elements being compared / swapped in another data structure e.g. a list and then iterate forwards or backwards displaying the current state of the collection.

This is the solution I have used in the sketch shown in the linked discussion.