I'm new to this forum so please be patient.
I'm studying two sort algorithms: counting sort and bucket sort.
In numerous books I found examples, as a 'proof' that these algorithms work, but those test use a specific set of values.
So I want to know how can I do a formal mathematical proof of the working of the mentioned algorithms.
Any clue will help, I don't know exactly where to start(of course if you can provide a method would be better)
Thanks in advance