Analysis and comparison of sorting and search algorithms in C programming language

U ovom završnom radu analizirani su i uspoređeni algoritmi za sortiranje i pretraživanje. Implementacija ovog zadatka izvršena je u programskom jeziku C. Definirani su pojmovi algoritma i strukture podataka. Rad prikazuje princip rada za svaki algoritam, te analizira vremensku složenost za svaki od njih. Analiza je pokazala kako su merge sort i quick sort najbrži algoritmi sortiranja, također analiza pokazuje kako odabir algoritma za pretraživanje ovisi o strukturi podataka koju koristimo, te ulaznim podacima.In this paper, algorithms for sorting and searching are analyzed and compared. The implementation of this task was done in the programming language C. The concepts of algorithm and data structure were defined. The paper shows the principle of operation for each algorithm, and analyzes the time complexity for each of them. The analysis showed that merge sort and quick sort are the fastest sorting algorithms, the analysis also shows that the selection of the search algorithm depends on the data structure we use and the input data