Skip to main content

STL - sort() and is_sorted() algorithms

Today I would like to show first article about some example of usage STL (Standard Template Library) library and its algorithms. First thing which I would like to present is usage of std::sort() and std::is_sorted() algorithms. Function std::sort() sorts selected range of elements of container in ascending order. Function std::is_sorted() checks whether selected range of elements of container is sorted in ascending order.
Take a look at following example of usage those functions:
Output of below example is:

At the beginning of that example we declare vector of int-typed elements using initializer_list and prints it using range-based for loop (URL).
In point (I) we are using std::is_sorted() function to check whether vector is sorted according to ascending order. Notice that we are iterating through whole vector (from testVector.begin() to testVector.end()). Function returns false because our vector is not sorted yet. We can see results in first line of output.
In point (II) we are sorting part of our testVector. Notice that we are not iterating through whole vector here, therefore only that part where we are iterating will be sorted. In that case, only three first elements of vector will be sorted.
Now look at point (III). We are checking here whether first three elements of our vector are sorted (we are iterating through 3 elements in std::is_sorted() function). Now std::is_sorted() returns true because first three elements are already sorted. We can see results of that sorting in second line of program output. Last part of that example using std::sort() to sort all elements of testVector. We can see result in third line of our output.

If you would like to compile below example on your computer you can quickly download it from github repository: https://github.com/xmementoit/CppAdventureExamples/tree/master/stl/sortAndIsSorted

Comments

Popular posts from this blog

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm. std::count (firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch std::count_if (firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a) . So, count_if returns number of elements where UnaryPredicateFunction returns true for. For better understanding let's take a...

Advanced C++ - Mutable Class Field

Today I would like to present C++ class' feature called mutable class field . Mutable class field is class' field modifier which allows to change its value even if object of the class is declared as const . Take a look at the example: Output of this example is: In point I of that example we are defining object of TestClass . Note that this object is const . As you can see in point Ia this class has three different member fields ( constInt, mutableConstInt, nonConstInt ). Those variables are public for this example, but do not worry about encapsulation here. It is just omitted for simplify this example. As you can see one of this member fields is marked as mutable class file using mutable keyword ( mutableConstInt ). Such variable can be modified even if object of class TestClass is const . It will be explained in next points of this example. In point II we are printing default values of testObject object initialized in initialization list of TestClass' default c...

C++ Multithreading - Race conditions

In the previous C++ Multithreading article I presented you how to pass parameters between threads. Take a detail look on the output of that example once again: In the first line of that output you can notice that output text from two threads is mixed. You are probably wondering why it happens? It is because we are not protecting resources which are shared by two threads (in this example cout stream is shared in both threads) which causes multithreading's phenomenon called race condition . Because threads switching and accessing to shared resources are managed by operating system we do not know when std::cout stream will be accessed by main thread and when it will be accessed by second thread. Therefore in the previous article I mentioned that output of the example can be little different on your computer than my output example. What's more it is possible that this output will be different for few consecutive invoking of the example on the same machine. It is beca...