I have googled for get information about computational time of some compression algorithms but information seems contradict each other. I need worst case performance of the following algorithm Sliding Window, Open Window, Threshold and STTrace. All algorithms should have quadratic time. Do you confirm?

closed as off topic by whuber May 1 '12 at 16:21

Questions on Geographic Information Systems Stack Exchange are expected to relate to geographic information systems within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here. If this question can be reworded to fit the rules in the help center, please edit the question.

Browse other questions tagged or ask your own question.