Posted on February 12, 2010, 2:41 pm, by kishore, under
IDE,
Software,
os.
[I know that this topic should be in the Algorithms & Data Structures threads (I have already posted there) but since I always get fast and good answers from here, I wonder if anyone could give a tip.] I have an application that have the following features (with respect to the ADT): 1 – At the beginning there are several insertions. As the application executes, the number of insertions will be drastically reduced. 2 – There are always several lookups as the application runs.
Tags:
algorithms,
allocate-new,
are-already,
discarded-since,
following,
have-already,
number,
the-beginning,
the-following,
there,
with-respect No Comments |
Read the rest of this entry »
Posted on December 4, 2009, 6:47 am, by , under
Object.
Ok, I have been thinking about this alot lateley, that maybe we should advance our coding by using new algorithims. Maybe then we should have a complete one year course (i do not know if there is one) on how to come up with better algorithims for our computers. I mean look at what we had in the past only 64 mb ram (still have the computer) and it ran pretty good i could play runescape and stuff.