This C++ program demonstrates last occurence of an element using upper_bound algorithm. The program takes an element from the input and the is passed to the upper_bound() function alongwith the iterators to the beginning and end of the vector. The function returns an iterator to the first occurence of the element. Here is the source … Read more
This C++ program demonstrates first occurence of an element using lower_bound algorithm. The program takes an element from the input and the is passed to the lower_bound() function alongwith the iterators to the beginning and end of the vector. The function returns an iterator to the first occurence of the element. Here is the source … Read more
This C++ program rearranges the container elements using stable_partition() algorithm. The algorithm rearranges the elements of the container such that the elements for which predicate returns true precede the elements for which the predicate returns false. The relative order of the elements is preserved. Here is the source code of the C++ program which rearranges … Read more
This C++ program rearranges the container elements using partition() algorithm. The algorithm rearranges the elements of the container such that the elements for which predicate returns true precede the elements for which the predicate returns false. Unlike stable_partition(), the relative order of the elements is not preserved. Here is the source code of the C++ … Read more
This C++ program demonstrates the nth_element algorithm. The function rearranges the container elements in such a way that the element at the nth position is the element that would be in that position in a sorted sequence. The other elements are left without any specific order, except that none of the elements preceding nth are … Read more
This C++ program demonstrates using partial_sort_copy() algorithm. The algorithm partially sorts the container elements and copies the sorted elements into another container according to the capacity of the second container. Here is the source code of the C++ program which demonstrates using partial_sort_copy() algorithm. The C++ program is successfully compiled and run on a Linux … Read more
This C++ program demonstrates the stable_sort() algorithm. The program creates vector of objects of class Student which has attributes – name, section and group. The stable_sort algorithm first sorts the elements with name as the key and then the elements are sorted with their section as the key. The order of the elements with same … Read more
This C++ program demonstrates the sort() algorithm. The program creates a vector of strings, sorts them using sort algorithm without predicate to sort them in default order and with greater predicate to sort them in reverse order and prints it. Here is the source code of the C++ program which demonstrates the sort() algorithm. The … Read more
This C++ program demonstrates the iter_swap() algorithm. The creates an array and a vector of integers and swaps the elements at odd positions of vector and array. The elements of vector and array are then printed on standard output. Here is the source code of the C++ program which demonstrates the iter_swap() algorithm. The C++ … Read more
This C++ program demonstrates the swap_ranges() algorithm. The program creates two arrays of integers and swaps the elements by passing iterators to the range of elements to be swapped into the function swap_ranges. Here is the source code of the C++ program which demonstrates the swap_ranges() algorithm. The C++ program is successfully compiled and run … Read more
