Задача этой книги дать краткое и четкое изложение языка С++ в соответствии со стандар том iso/iec 14882. Она предназначена для студентов, изучающих язык «с нуля»

inplace_merge

Àëãîðèòì inplaCe_merge âûïîëíяåò ñëèяíèå äâóõ îòñîðòèðîâaííûõ ÷añòåé îäíîé ïîñëåäîâaòåëüíîñòè. Ãðaíèöû ïåðâîé ÷añòè çaäaþòñя äâóìя ïåðâûìè ïaðaìåòða- ìè, ía÷aëî âòîðîé ÷añòè — òðåòüèì ïaðaìåòðîì.
template
vOid inplaCe_merge(Bi first, Bi middle, Bi last); template
vOid inplaCe_merge(Bi first, Bi middle, Bi last, COmpare COmp);

lexicographical_compare

Àëãîðèòì lexiCOgraphiCal_COmpare âûïîëíяåò ïîýëåìåíòíîå ñðaâíåíèå äâóõ ïî- ñëåäîâaòåëüíîñòåé ëèáî ñ èñïîëüçîâaíèåì îïåðaöèè <, ëèáî ñ ïîìîùüþ çaäaííîé ôóíêöèè COmp. Âîçâðaùaåòñя true, åñëè ïåðâaя ïîñëåäîâaòåëüíîñòü ëåêñèêîãða- ôè÷åñêè ìåíüøå âòîðîé (òî åñòü î÷åðåäíîé ýëåìåíò ïåðâîé ïîñëåäîâaòåëüíîñòè îêaçaëñя ìåíüøå ñîîòâåòñòâóþùåãî ýëåìåíòa âòîðîé), è false â ïðîòèâíîì ñëó-
÷aå. Åñëè äëèíû ïîñëåäîâaòåëüíîñòåé íå ñîâïaäaþò, íåäîñòaþùèå ýëåìåíòû ñ÷è- òaþòñя ìåíüøèìè ñîîòâåòñòâóþùèõ ýëåìåíòîâ äðóãîé ïîñëåäîâaòåëüíîñòè.
template bOOl lexiCOgraphiCal_COmpare
(In1 first1, In1 last1, In2 first2, In2 last2); template
bOOl lexiCOgraphiCal_COmpare
(In1 first1, In1 last1, In2 first2, In2 last2, COmpare COmp);

Ïðèìåð:
inClude inClude inClude using namespaCe std; int main(){

COnst intm= 5;
dOuble a[m] = {5, 3, 2, 3, 1},
b[m] = {5, 3, 2, 3, 2},
C[m] = {5, 3, 1, 3, 10};
COut << lexiCOgraphiCal_COmpare(a,a+ m, b,b+ m); //1
COut << lexiCOgraphiCal_COmpare(a,a+ m, C,C+ m); //0 COut << lexiCOgraphiCal_COmpare(a,a+ m, b,b+ m, greater()); // 0 return 0;
}

lower_bound, upper_bound

Àëãîðèòì lOwer_bOund íaõîäèò èòåðaòîð ía ïåðâûé, a upper_bOund — ía ïîñëåäíèé èç ýëåìåíòîâ îòñîðòèðîâaííîé ïîñëåäîâaòåëüíîñòè, ïåðåä êîòîðûì ìîæíî âñòa- âèòü çaäaííîå çía÷åíèå, íå íaðóøaя óïîðяäî÷åííîñòè.
template
FOr lOwer_bOund(FOr first, FOr last, COnst T& value); template
FOr lOwer_bOund(FOr first, FOr last, COnst T& value, COmpare COmp);
template
FOr upper_bOund(FOr first, FOr last, COnst T& value); template
FOr upper_bOund(FOr first, FOr last, COnst T& value, COmpare COmp);