Edited by author 17.03.2007 22:05

Edited by author 17.03.2007 22:05

Edited by author 17.03.2007 22:49

Edited by author 19.03.2007 18:44

Your program is O(n^2). But you can write simple quick sort(O(n*log(n))) and got AC!!!

SORRY!IM BEGINNER,AND I SHALL VERY PLEASED TO YOU IF YOU SAY ME WHAT IT MEANS O(n*log(n))) OR O(n^2). THANK!!!!

Edited by author 17.03.2007 23:49

I think I found book about quick sort

Edited by author 18.03.2007 00:54

It so hard????

No :)
Qsort is standart sorting  algo
you should not understand how it's work deeply just
use it when you need(copypost:) or use included in C++

by the way this problem can be solved in  O(n)
if you post your mail I can send you several variants

P.S.
O() is complexity of algo
shortly to say
for example

for i:=1 to n  do ...     O(n)

for i:=1 to n  do
for j:=1 to n  do ...   O(n^2)

but it's very stupid definition:)

Edited by author 18.03.2007 02:37

Why O(n), I think it's O(2*n)!!!

:)

O(2*n)= O(3*n)=O(100000000000000000*n) = O(n)
constant is not uses with n in O

so with small n sometimes O(N^2) solutions work faster then
O(n) because of constant


my O(n) is only 1 cycle for input for i:=1 to n

MY mail:serchch@mail.ru!THANK YOU VERY much!YOU HELP me second time!!!!THANK YOU!!!!!!!!

IS QSORT FUNCTION USE IN <ALGORITHM>?

Edited by author 19.03.2007 17:50

YES.
int a[100];
sort(a,a+100);

Edited by author 19.03.2007 18:43

Edited by author 19.03.2007 18:43

My algo is the same :)
[DELETED]

Edited by author 19.03.2007 18:34

SORRY!CAN YOU SAY WHAT MEANS MALLOC?THANK!!!!

Edited by author 19.03.2007 18:24

char *t;
t = (char*)malloc(sizeof(char)*10);
equal to
char *t = new char[10];

THANK!!!NOW I UNDERSTAND!

:)