## Search found 65 matches

Tue Feb 21, 2006 10:45 am
Forum: Algorithms
Topic: WHat is the best heapsort
Replies: 2
Views: 1176

### AM i alright?

I have working on Heapsort for my undergrad thesis. I derived a new heapsort thats complexity is nlogn + nloglogn - n where as the carlsson has nlongn + nloglogn As far i know that was the best heapsort. If so then my one is better than carlsson. Plz anyone let me know that i m alright.................
Sat Feb 18, 2006 1:41 pm
Forum: Algorithms
Topic: WHat is the best heapsort
Replies: 2
Views: 1176

### WHat is the best heapsort

As far i know carlsson's heap sort algorithm is the best for heapsort even better than corman. Is there any better than carlsson and what is the complexity of that for number of comparisons
Tue Apr 26, 2005 5:24 pm
Forum: Algorithms
Topic: CONVEXhull coverage
Replies: 0
Views: 770

### CONVEXhull coverage

Is there any algorithm for a given convex hull and given radius(r), how many minimal point(with radious r) is needed for cover the whole area?
Like the mobile network, how many tower is needed for a particular area
if each tower cover r distance?
Fri May 14, 2004 5:09 am
Forum: Volume 101 (10100-10199)
Topic: 10106 - Product
Replies: 98
Views: 26944
I really dont know why ur code
is not responding to my VC++(6) compiler
THese emotions are really problematic
is the case of brackets
Sat May 08, 2004 10:27 am
Forum: Volume 101 (10100-10199)
Topic: 10109 - Solving Systems of Linear Equations
Replies: 18
Views: 8737
I do feel trouble for such kind of input too. :( In some cases u will find input in range of long long and x[1], x[2], x[3].......x[n] in that range too. But numerator and denomirator may exeed the range in the cases of multipliction of guessian. The best way i think each time devide the numbers whi...
Mon Mar 15, 2004 6:42 pm
Forum: Volume 101 (10100-10199)
Topic: 10127 - Ones
Replies: 32
Views: 12307
neo_tohin!
its really nice to get a reply about 2 years later on a topic!
U should know I m not smart like u..............
wt is that plz. explain.......
Sat Aug 23, 2003 6:45 pm
Forum: Algorithms
Topic: Careers in algorithms?
Replies: 11
Views: 4109
I completely agree with subeen............. :lol: The fun and the happiness gained by the solving is really excellent...... I can remember, to solve a program of I just took 2 month time(the prob no. was 602). By the time i got WA message more that 20 times... :-? But when i solved that i knew how m...
Fri Aug 22, 2003 5:28 pm
Forum: Volume 105 (10500-10599)
Topic: 10519 - !! Really Strange !!
Replies: 35
Views: 13480
SAME 2 ME
HAVE 2 CHEAK CRITICAL INPUTS
Fri Jul 11, 2003 10:42 am
Forum: Volume 105 (10500-10599)
Topic: 10530 - Guessing Game
Replies: 57
Views: 27473
Why there will bbe right?
if(StrCmp(line,"right") == 0)
Why not right on
Mon Jun 23, 2003 7:35 am
Forum: Volume 105 (10500-10599)
Topic: 10517 - Wind of Change!
Replies: 12
Views: 4293
It may also happened i u dont take all the variables in double
my 1st code with long (deg, min) proved WA
Sun Jun 01, 2003 12:28 pm
Forum: Other words
Topic: acm solve sites
Replies: 51
Views: 25831
As far i know there is no cold war in between NSU & AIUB. (Like NDC or DC) So, I dont know wt Mr. ronty want to mean................ I completely agree with tomal bhai.... No one have the rights to say against a versity if just a single faculty is wrong(still we dont know is it true or false). I thi...
Mon May 26, 2003 11:56 am
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21463
actually u dont need to break counting the sum.......
It means write in the following way......

if((*(p+i)>96&&*(p+i)<123)||(*(p+i)>64&&*(p+i)<91))
{
sum++;
}
Sun May 18, 2003 2:07 am
Forum: Volume 4 (400-499)
Topic: 446 - Kibbles "n" Bits "n" Bits "n" Bits
Replies: 50
Views: 4426
Its cant be fair
If i can use atoi then why i wont allow for itoa..........
any way wt to do.....try with another alg.......
Sun May 18, 2003 2:01 am
Forum: Volume 4 (400-499)
Topic: 494 - Kindergarten Counting Game
Replies: 119
Views: 21463
U shouldnt break the loop in the if statement run untill any new line entered and count sum..........
that all...............

if((*(p+i)>96&&*(p+i)<123)||(*(p+i)>64&&*(p+i)<91))
{
sum++;
break;
}
Fri May 16, 2003 10:31 pm
Forum: Volume 4 (400-499)
Topic: 446 - Kibbles "n" Bits "n" Bits "n" Bits
Replies: 50
Views: 4426

### 446---------compiler error

Plz give me just one reason for satisfing with compiler error! not prob of submiting i submits with acm site......... :cry: :x /* @JUDGE_ID: XXXXX 446 C++ */ #include <stdio.h> #include <stdlib.h> #include <string.h> void bin13(char x[], int l) { int i,j; if(l==1) printf("000000000"); else if(l==2) ...