Сортировка массива на Си

[Покемон]

Доброго времени суток Нужна ваша помощь.
Задача следующая:
есть массив в котором 100 элементов(каждый элемент-число), необходимо отсортировать их по возрастанию или убыванию. Какой алгоритм здесь применить?
Заранее благодарен. Спасибо за внимание.

[dev_il]

еслиу у тебя 100 элементов...можно простым пузырьком и всё..будет быстро :-)
можешь вообще написать sort(a,a+100) , подключив перед этим #include<algorithm.h>

[Ламер_001]

Header File
stdlib.h

Category
Memory and String Manipulation Routines

Prototype
void qsort(void *base, size_t nelem, size_t width, int (_USERENTRY *fcmp)(const void *, const void *));

Description
Sorts using the quicksort algorithm.

qsort is an implementation of the “median of three” variant of the quicksort algorithm. qsort sorts the entries in a table by repeatedly calling the user-defined comparison function pointed to by fcmp.

base points to the base (0th element) of the table to be sorted.
nelem is the number of entries in the table.
width is the size of each entry in the table, in bytes.

fcmp, the comparison function, must be used with the _USERENTRY calling convention.

fcmp accepts two arguments, elem1 and elem2, each a pointer to an entry in the table. The comparison function compares each of the pointed-to items (*elem1
and *elem2), and returns an integer based on the result of the comparison.

*elem1 < *elem2 fcmp returns an integer < 0
*elem1 == *elem2 fcmp returns 0
*elem1 > *elem2 fcmp returns an integer > 0

In the comparison, the less-than symbol (<) means the left element should appear before the right element in the final, sorted sequence. Similarly, the greater-than (>) symbol means the left element should appear after the right element in the final, sorted sequence.

Return Value
None.