@sunny agarwal: Yes, it would be considered constant space.. even if it required 1MB of space . By big oh notation of space, we mean cases where input size, 'n' tends to infinity and the space requirement of the algorithm proposed does not approach infinity.
here, even if n->infinity, input size would still be 8kb.. hence O(1) space. hope tat helps. On Jun 13, 12:38 pm, sunny agrawal <sunny816.i...@gmail.com> wrote: > hello all, > what if character are not ASCII but are Unicode characters. > then we will need 8 KB of memory instead of 32 bytes as in for ASCII's > would that also be considered as Constant space( O(1) ) as it is independent > of input size ?? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
