what is the complexity of a constant?

0 ⤊

what is the complexity of a constant?

2007-11-09 00:53:35 · 3 answers · asked by priya 2 in Science & Mathematics ➔ Mathematics

3 answers

If you are talking in terms of computational running time complexity of an algorithm, the running-time complexity of a constant is 0. Only non-constant functions have complexity. So if you have an algorithm that runs in constant time, this is not complex at all.

2007-11-09 01:16:12 · answer #1 · answered by Jeƒƒ Lebowski 6 · 0⤊ 0⤋

It's not complex at all, that's why it's a constant.

2007-11-09 01:10:39 · answer #2 · answered by IRN_Ag 2 · 0⤊ 0⤋

Perhaps you could expand a little on your question.

2007-11-09 01:16:17 · answer #3 · answered by ironduke8159 7 · 0⤊ 0⤋