Tags
#cormen_2009_introductiontoalgorithms #datastructuresandalgorithms
Question
An algorithm is said to be [...] if, for every input instance, it halts with the correct output.
Tags
#cormen_2009_introductiontoalgorithms #datastructuresandalgorithms
Question
An algorithm is said to be [...] if, for every input instance, it halts with the correct output.
Tags
#cormen_2009_introductiontoalgorithms #datastructuresandalgorithms
Question
An algorithm is said to be [...] if, for every input instance, it halts with the correct output.
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it
An algorithm is said to be correct if, for every input instance, it halts with the correct output.
Original toplevel documents (pdfs)
- owner: Malore - (no access) - Introduction to Algorithms [3 ed] (Cormen, Leiserson, Rivest, Stein).pdf, p6
- owner: kosutosis - (no access) - (2009) Introduction to algorithms - The MIT Press.pdf, p27
- owner: djk247 - (no access) - Algorithms_3rd.pdf, p27
- owner: artiwa13 - (no access) - Intro_to_algos.pdf, p27
Summary
| status | not learned | | measured difficulty | 37% [default] | | last interval [days] | |
|---|
| repetition number in this series | 0 | | memorised on | | | scheduled repetition | |
|---|
| scheduled repetition interval | | | last repetition or drill | | | | |
|---|
Details
No repetitions