Day 5 - New algorithm

Hey there and there we are in another devlog! This is going to be quite short but whatever.

New algorithm

I added a new algorithm, the Insertion sort!
I tested it multiple times and I managed to get it to work in about an hour.
Then, I even fixed a bug where sometimes a value would disappear.. (I didn’t put a “=” , lol)

What’s next?

Next thing is going to be to add simple stats about the algorithm. Like I said in the previous devlog it’s going to be:

• Comparisons
• Swaps
• Array accesses

Another thing I’ll work on is to add a way to show/hide the actual value of a rectangle. It will have a limit, cause when you decide to widen the quantity of values, they don’t have enough space to see the text of the value clearly.

Next algorithms

I won’t focus on them for now since I already implemented some starting algorithms. I first want to polish some code (It’s going to be bad anyway) and add these little features first..

The reason? Well, I wanted to add Quick sort and Merge sort but they’re quite hard to create in the style I need.. and I noticed that they might need vectors to work.. and they haven’t teached me vectors at school…

So first, I need to understand how vectors work in C++, THEN I’ll add Merge sort and Quick sort (Or I’ll just ignore them and ship the project anyway. I’ll definitely add them after shipping though)

(Oh yeah, I also need to fix how the rectangle change color when the sorting is active. It’s a bit rough now.. I need to make it better.)

Anyway see you in another devlog and thank you!