Comments on Programming Experiments: Haskell Stacks : Two Different Ways

O(2n) is equivalent to O(n). The function runs in ...

2007-12-03T16:38:00.000-08:00

O(2n) is equivalent to O(n). The function runs in time linearly proportional to the size of the list (n)

;)

Thanks for the info, ken. :)

2006-12-21T11:12:00.000-08:00

Thanks for the info, ken. :)

Hi Brian Your Stack datatype is essential equal t...

2006-12-13T02:06:00.000-08:00

Hi Brian

Your Stack datatype is essential equal to the normal [] (List) datatype, except that you have ruled out the possibility of an empty stack.

But why don't you just use the following implementation of stacks:

empty = []

push stack elem = elem : stack

pop (elem : stack) = stack

top (elem : stack) = elem

All operations are cheap constant time operations.