C# Programiranje Tutorijal-Nizovi-Algoritmi sortiranja-Quick Sort

C# Programiranje Tutorijal-Nizovi-Algoritmi sortiranja-Quick Sort Quick sort je efikasan, rekurzivni algoritam za sortiranje elemenata niza ili liste. Osnovna ideja je da se niz razdvaja na manje podnizove tako da se element nazvan "pivot" postavi na svoje mesto, gde su elementi manji od njega s leve strane, a veći s desne. Onda se isti postupak primenjuje rekurzivno na podnizove pre i posle pivota. C# Programming Tutorial-Arrays C# Programming Tutorial-Arrays-Sorting Algorithms-Quick Sort Quick sort is an efficient, recursive algorithm for sorting the elements of an array or list. The basic idea is to split the array into smaller subarrays so that an element called a "pivot" is placed in its place, where the elements are smaller than it on the left and larger on the right. Then the same procedure is applied recursively to the substrings before and after the pivot. #quicksort #programming #tutorial