израильское; программистское

[shufel]

перетряхивая архивы:

Up till now there were quite a few known ways to sort a vector:
bubble sort, quick sort, insertion sort, heap sort etc.
it was also proven that the fastest sort possible is only O(n*logn)).
however a new sort was discovered in israel this week that can sort any vector in O(1):

char * israeli_sort (char * vector_unsorted)
{
char * vector_sorted;
vector_sorted = vector_unsorted;
return vector_sorted; /* don't worry, it will be o.k. - trust me!!! */
}

Comments

[city-rat.livejournal.com]

шмешно :)

[(Anonymous)]

И таки что бы Вы думали? Оно работает!

РОТФЛМАО

[wildernesscat.livejournal.com]

Шедевр! На стенку!