STL algorithm SWAP MAX MAX_ELEMENT SORT COUNT COUNT_IF

1. C++ Algorithms
Programming with Sikander shorturl.at/rwxUX

2. Mohammed Sikander
 swap
 max
 min
 max_element
 min_element
 count
 find
 sort
 count_if
 find_if

3. Mohammed Sikander

4. Mohammed Sikander
template< class T >
const T& max( const T& a, const T& b );
https://youtu.be/9lBBaAB2H0g

5. Mohammed Sikander
template< class T >
const T& min( const T& a, const T& b );
https://youtu.be/9lBBaAB2H0g

6. Mohammed Sikander
template< class ForwardIt >
ForwardIt max_element( ForwardIt first, ForwardIt last );
https://youtu.be/9lBBaAB2H0g

7. Mohammed Sikander
template< class ForwardIt >
ForwardIt min_element( ForwardIt first, ForwardIt last );
https://youtu.be/9lBBaAB2H0g

8. Mohammed Sikander
 Find the smallest element in the array and swap with
the first element.
 Find the largest element in the array and swap with the
last element.
 You should use the stl algorithms to find the largest /
smallest element in the array and swap algo to swap
the elements.

9. Mohammed Sikander
template< class InputIt, class T >
InputIt find( InputIt first, InputIt last, const T& value )
https://youtu.be/FUNs1pRJOso

10. Mohammed Sikander
template< class InputIt, class T >
int count( InputIt first, InputIt last, const T& value );
https://youtu.be/ASbv3sdmQgE

11. Mohammed Sikander

12. Mohammed Sikander
Write code to count the number of occurrences of a given
character, the string is stored in std::string.

13. Mohammed Sikander

14. Mohammed Sikander
 Given the string find the character which is occurring
the most number of times.

15. Mohammed Sikander
template< class RandomIt >
void sort( RandomIt first, RandomIt last );
https://youtu.be/JQ8_IbeUTdA

16. Mohammed Sikander
template< class RandomIt, class Compare >
void sort( RandomIt first, RandomIt last, Compare comp );
The signature of the comparison function should be equivalent to the following:
bool cmp(const Type1 &a, const Type2 &b);
https://youtu.be/n9SRg4XBd7Y

17. Mohammed Sikander
 Sort a list of string in ascending order
based on length.

18. Mohammed Sikander

19. Mohammed Sikander
 Given a list of numbers, count the
numbers which are prime.
12, 21, 34, 32, 5, 65, 34, 23, 43

20. Mohammed Sikander
template< class InputIt, class UnaryPredicate >
int count_if( InputIt first, InputIt last, UnaryPredicate p );
https://youtu.be/ASbv3sdmQgE

21. Mohammed Sikander
template< class InputIt, class UnaryPredicate >
InputIt find_if( InputIt first, InputIt last, UnaryPredicate p );

22. Mohammed Sikander
 Given an array of numbers, find all the
numbers which are prime and print them
on screen.
 Use find_if to find the next prime number
in array.

23. Mohammed Sikander

24. Mohammed Sikander
Thank you