Hi. I have a program where I have to sort a list using three different sorts (quick, heap, and merge). I have all the done but now the problem is that I have to calculate the exact complexity on each. IF anyone can help me with how to code that into the program that would be great. Obviously you'd have to have some kind of counts but I don't know the calculations.