Yes it works very well for numbers I enter from command line . I've also tried it on about 1800 numers and it worked .When I gave the array the size 2000 the program crashed .
I'll post the code in...
Type: Posts; User: TechHigh
Yes it works very well for numbers I enter from command line . I've also tried it on about 1800 numers and it worked .When I gave the array the size 2000 the program crashed .
I'll post the code in...
stop condition is iR==iL and that's all the code I've got .swap is a simple function that swaps the two array elements .
then quzah , why is this algorithm so higly praised ? The implementation is also copied from a book ...
Dave_Sinkula : it simply acts like going in infinite loop , meaning it enters the algorithm...
I've implemented the quicksort algorithm in Visual Studio 6.0 SP5 in a console project .
It finishes in 0.01 seconds for an array of 1700 elements .For 2000 elements it crashes .
It's probably a...
i've fixed the errors but it's still ugly ....
maybe redesign and a few comments will help
my progress is 60 %
I tried to do something and partially it works (it finds a substring but not the longest) .
It's also probably the most uneficient algorithm ever .
I hoped someone knows a...
Hi.I need an algorithm that finds out the longest substring of 2 strings .
It's for school project .
Thanks guys .You convinced me . It would probably be extremely complicated and totally useless to calculate those constants .
So if I'll stick to only timing the algorithms , what compiler/IDE would...
I see laserlight knows what I'm talking about . I wanna calculate theta(n) using the formulas in the book , but I wanna calculate the constants too
That's what bothers me . Putting Knuth's formulas...
Yes , there is .If you don't believe me believe Donald Knuth , the author of Art of Programming the most respected book in the field .
Mathemathical equations are shown in that book that calculate...
I agree with you .
But no matter how long it will take , and how much I'll have to study , I have this obsession of knowing what happens on every clock cycle .
This a long term ambition .
And...
I was planning to calculate running time and get a close result to the real one. Under windows that would be much harder
yes , although I was using XP I made a fat32 partition especially for this problem and I booted using a win 98 boot disk .
I am trying to "benchmark" some sorting algorithms I learned from a book .
The problem is I can't reserve into memory more than 16383 long variables .
That means 64 kB .
I've read that a segment...