[Subject Prev][Subject Next][Thread Prev][Thread Next][Subject Index][Thread Index]

*To*: linux-india-programmers@xxxxxxxxxxxxxxxxxxxxx*Subject*: Re: "time complexity"*From*: Shridhar Daithankar <shridhar_daithankar@xxxxxxxxxx>*Date*: Wed, 17 Jan 2001 17:15:26 +0530*Organization*: Persistent Systems Pvt. Ltd.*References*: <F341HaKtKufVma0osA9000008ac@xxxxxxxxxxx>

Hi I guess it depends upon the algorithm you are using too, unless you are calculating time complexity of storage and retrieval itself. I would like to know result of your experiment. My initial guess is that they affect the time complexity in a simple predictable way depending upon the algorithm. (Looks silly, isn't it?) Bye Shridhar Rajeev Rao wrote: > If I use a specialised container, such as a map or priority que, provided by > the STL, I would like to their impact on the time-complexity. It would take > a lot of time to look at the STL implementations, hence a computer doing the > job would be nice.

**References**:**Re: "time complexity"***From:*Rajeev Rao

- Prev by Subject:
**Re: "time complexity"** - Next by Subject:
**Re: "time complexity"** - Previous by thread:
**Re: "time complexity"** - Next by thread:
**Re: "time complexity"** - Index(es):