Hi, I started learning C recently and I don't have much experience. I need to make a program that will factorize an entered integer number and I should also explain the program. No problems with that . However I should also write the complexity of the program (you know like O(n), O(log2n) etc.). I'm stuck there, how should I write the complexity using n (the entered number)? Basicaly it doesn't depend on how big is the entered number, but how big are his factors. Some big number like 3^20 will be factorized faster than some relatively little prime number like 5413. Can I somehow express my program's compexity using n or there is another way I should do that? Any help will be appreciated.
P.S. yes the program probably can be improved, but that isn't important at the moment (4294967291 is the largest prime that can be stored in unsigned int ...and the program factorizes it for <1s, so I don't think there is any need for faster algorithm :P). Maybe if I used unsigned long long...
P.P.S. sorry, names and text in the program aren't in English, I'm in a hurry, can't translate right now. But you get the point ...I hope . Sorry for reading all this