Algoritmalar kitaplığı

 

C++

Dil

Standart kütüphane başlıkları

Kavramlar

Yardımcı program kütüphanesi

Metin kütüphanesi

Konteyner kütüphanesi

Algoritmalar kütüphanesi

İteratörler kütüphanesi

Nümerik işlemler kütüphanesi

Giriş/çıkış kütüphanesi

Yerelleştirme kütüphanesi

Düzenli ifadeler kütüphanesi (C++11)

Atomik işlemler kütüphanesi (C++11)

Thread kütüphanesi (C++11)

 

Algoritma kitapligi

Functions
Non-modifying sequence operations
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifying sequence operations
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partitioning operations
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Sorting operations (on sorted ranges)
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binary search operations (on sorted ranges)
lower_bound upper_bound	binary_search equal_range
Set operations (on sorted ranges)
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operations
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimum/maximum operations
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Numeric operations
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C library
qsort	bsearch

 

Algoritmalar kitapligi, bir elemanlar araligi uzerinde islem yapan ve bir cok farkli amaca hizmet eden (or. arama, siralama, sayma, degistirme gibi) fonksiyonlar tanimlar. Elemanlar araligi [ilk, son) sagdan acik araligi olarak tanimlanmistir ve son eleman, isleme tabi tutulacak araligin en son elemanindan bir sonraki elemana isaret eder.

Degistirmeyen dizi islemleri
Defined in header <algoritma>
all_of any_of none_of (C++11) (C++11) (C++11)	bir elemanlar araligindaki tum, bir kisim veya hic biri icin bir dogruluk ifadesinin true dogru olup olmadigini denetler. (function template)
for_each	bir fonksiyonu elemanlar araligindaki tum elemanlara uygular (function template)
count count_if	belirli bir kriteri saglayan eleman sayisini doner (function template)
mismatch	iki araligin farkli oldugu ilk pozisyonu bulur (function template)
equal	iki kumenin elemanlarinin ayni olup olmadigini belirler (function template)
find find_if find_if_not (C++11)	belirli bir kriteri saglayan ilk elemani bulur (function template)
find_end	belirli bir araliktaki son dizi elemanlari bulur (function template)
find_first_of	bir grup elemandan herhangi birinin ilk gectigi yeri bulur (function template)
adjacent_find	birbirinin ayni (ya da farkli bir iliskiyle iliskilendirilmis) iki komsu elemani bulur (function template)
search	searches for a range of elements (function template)
search_n	searches for a number consecutive copies of an element in a range (function template)
Degistiren dizi islemleri
Defined in header <algoritma>
copy copy_if (C++11)	bir elemanlar araligini baska bir yere kopyalar (function template)
copy_n (C++11)	belli bir sayida elemani baska bir yere kopyalar (function template)
copy_backward	bir dizi elemani ters sirada kopyalar (function template)
move (C++11)	moves a range of elements to a new location (function template)
move_backward (C++11)	moves a range of elements to a new location in backwards order (function template)
fill	belli bir degeri araliktaki elemanlara atar (function template)
fill_n	belli bir sayida elemana bir degeri atar (function template)
transform	applies a function to a range of elements (function template)
generate	verilen bir araliktaki fonksiyonun aldigi degerleri doner (function template)
generate_n	bir fonksiyonun n defa cagrilmasiyla olusan degerleri kaydeder (function template)
remove remove_if	removes elements satisfying specific criteria (function template)
remove_copy remove_copy_if	copies a range of elements omitting those that satisfy specific criteria (function template)
replace replace_if	replaces all values satisfying specific criteria with another value (function template)
replace_copy replace_copy_if	copies a range, replacing elements satisfying specific criteria with another value (function template)
swap	swaps the values of two objects (function template)
swap_ranges	swaps two ranges of elements (function template)
iter_swap	swaps the elements pointed to by two iterators (function template)
reverse	reverses the order elements in a range (function template)
reverse_copy	creates a copy of a range that is reversed (function template)
rotate	rotates the order of elements in a range (function template)
rotate_copy	copies and rotate a range of elements (function template)
random_shuffle shuffle   (C++11)	randomly re-orders elements in a range (function template)
unique	removes consecutive duplicate elements in a range (function template)
unique_copy	creates a copy of some range of elements that contains no consecutive duplicates (function template)
Bolumleme islemleri
Defined in header <algorithm>
is_partitioned (C++11)	bir araligin verilen bir dogruluk ifadesiyle bolumlenip bolumlenmedigini belirler (function template)
partition	divides a range of elements into two groups (function template)
partition_copy (C++11)	copies a range dividing the elements into two groups (function template)
stable_partition	divides elements into two groups while preserving their relative order (function template)
partition_point (C++11)	locates the partition point of a partitioned range (function template)
Siralama islemleri (siralanmis araliklarda)
Defined in header <algoritma>
is_sorted (C++11)	checks whether a range is sorted into ascending order (function template)
is_sorted_until (C++11)	finds the largest sorted subrange (function template)
sort	sorts a range into ascending order (function template)
partial_sort	sorts the first N elements of a range (function template)
partial_sort_copy	copies and partially sorts a range of elements (function template)
stable_sort	sorts a range of elements while preserving order between equal elements (function template)
nth_element	partially sorts the given range making sure that it is partitioned by the given element (function template)
Ikili arama islemleri (siralanmis araliklarda)
Defined in header <algoritma>
lower_bound	verilen degerden daha kucuk olmayan ilk elemana isaret eden bir ilerletici doner (function template)
upper_bound	verilen degerden buyuk ilk elemandan baslayan bir ilerleyici (iterator) doner (function template)
binary_search	bir elemanin belli bir aralikta var olup olmadigini belirler (function template)
equal_range	belli bir anahtara esit olan elemanlar dizisi doner (function template)
Kume islemleri (siralanmis araliklarda)
Defined in header <algoritma>
merge	merges two sorted ranges (function template)
inplace_merge	sirali iki araligi yerinde birlestirir (function template)
includes	eger bir kume bir baska kumenin altkumesiyse, dogru doner (function template)
set_difference	computes the difference between two sets (function template)
set_intersection	computes the intersection of two sets (function template)
set_symmetric_difference	computes the symmetric difference between two sets (function template)
set_union	computes the union of two sets (function template)
Heap islemleri
Defined in header <algoritma>
is_heap	verilen bir araligin "max heap" olup olmadigini denetler (function template)
is_heap_until (C++11)	"max heap" olan en buyuk alt araligi bulur (function template)
make_heap	creates a max heap out of a range of elements (function template)
push_heap	adds an element to a max heap (function template)
pop_heap	removes the largest element from a max heap (function template)
sort_heap	turns a max heap into a range of elements sorted in ascending order (function template)
En kucuk/en buyuk islemleri
Defined in header <algoritma>
max	returns the larger of two elements (function template)
max_element	returns the largest element in a range (function template)
min	returns the smaller of two elements (function template)
min_element	returns the smallest element in a range (function template)
minmax (C++11)	returns the larger and the smaller of two elements (function template)
minmax_element (C++11)	returns the smallest and the largest element in a range (function template)
lexicographical_compare	eger bir aralik digerinden sozluksel olarak daha kucuk ise dogru doner (function template)
is_permutation (C++11)	bir dizinin baska bir dizinin permutasyonu olup olmadigini belirler (function template)
next_permutation	generates the next greater lexicographic permutation of a range of elements (function template)
prev_permutation	generates the next smaller lexicographic permutation of a range of elements (function template)
Sayisal islemler
Defined in header <sayisal>
iota (C++11)	verilen araligi baslangic degerinden baslayarak artan degerlerle doldurur (function template)
accumulate	bir elemanlar araligini toplar (function template)
inner_product	iki eleman araliginin icler carpimini hesaplar (function template)
adjacent_difference	bir araliktaki komsu elemanlarin farklarini hesaplar (function template)
partial_sum	bir elemanlar araliginin kismi toplamini hesaplar (function template)
C kitapligi
Defined in header <cstdlib>
qsort	tipi belirtilmemis bir elemanlar araligini siralar (function)
bsearch	tanimlanmamis tipte bir eleman icin bir diziyi arastirir (function)