CS problem ... PLEASE HELP!

[anonymouschris]

I have a CS question for you guys:

Is it possible to write an algorithm that will return the smallest and the largest numbers in a set of N numbers using only 1.5 * N comparisons in the WORST case?

Any help would be appreciated. Thanks.

 

[Magicthyse]

Choom!

(sound of thread going straight over my head)

 

[BrunoPuntzJones]

y=mx+b, or e=mc^2, should be one of those 2.

 

[ikar0s]

What the heck does that have to do with CounterStrike?

 

[gopunk]

lol

 

[777php]

<< What the heck does that have to do with CounterStrike? >>



haha

 

[trek]

<< What the heck does that have to do with CounterStrike? >>



heh, thats what i first thought....

-Trek

 

[Gusfo0]

He is writing a cheat!

AAHH!

 

[AkumaX]

its a sorting algorithm ( i think )

i dont know how it goes though

how about an algorithm that finds it in log n? binary search tree!

 

[dakata24]

<< What the heck does that have to do with CounterStrike? >>



exactly... this has no business in here..

like someone else said, must be writing some wallhack, aimbot, or respawn hack of some sort.. hehe. j/k..

PM me when you're done with hack though.. could use alittle help.