- #1
Coolphreak
- 46
- 0
So I'm writing a computer science paper and i had a few questions. I have created some algorithms; i see a lot of papers presented in the algorithm, theorem, proof layout. So, when i say algorithm x.x i basically describe what my algorithm? and when i have a theorem, is it basically saying that that algorithm(s) will give a particular result? and in the proof, I prove that the result will always result? and i prove things in correctness such as my algorithm always stops? Do i prove the algorithm's runtime? would the statement of the algorithm's runtime O(f(n)) go in the theorem section corresponding to that algorithm? and do i include the proof of that result in the proof section?
...thanks
...thanks