Oh yeah, Martin:
The halfsorted is calculated by the formula:
(A random number between 0 and 500) - (a random number between 0 and
450)
Thanks for your replies by the way. They really helped!
--~--~-~--~~~---~--~~
You received this message because you are subscrib
Martin,
Thanks you're a star!
Here's the rest of the data:
For the Selection sort
Time
# of # Random Half-Sorted Sorted
750 1.5 1.5 1.5
10003.1 2.6 3.1
15006.2 5.5 6.2
200011.010.111.0
250015.615.315.7
500062.561.
Anupama Murthi wrote:
> Hi all,
> linear time to determine cyclic strings... give a linear time algorithm to
> determine if a text T is a cyclic rotation of another string T'. For eg. ARC
> and CAR are cyclic rotations of each other.
>
> --
> Anupama
could i add in my 2 cents?if i am being stup
hi!
suppose i have a number, say.. '7'
i want to find the highest possible lcm of the set of numbers that add
upto 7
that is.. in this case
3+4 = 7
lcm(3,4) = 12
how do i go about this?
i could always brute force the possible combinations(1,6)(2,5)...
(1,2,4)(1,1,1,1,1,1,1)
this is clearly ve
