The article illustrates the working of the different relational operator on the array STL. The equality comparison ( == ) is performed by comparing the elements sequentially using operator ( == ), stopping at the first mismatch.
The less-than comparison ( < ) or greater-than comparison ( > ) behaves as if using algorithm lexicographical_compare, which compares the elements sequentially using operator () in a reciprocal manner (i.e., checking both a<b and b<a) and stopping at the first occurrence.
The implementation of relational operators on the array help us to compare between the data stored in different arrays.
Equivalent operators : Here are some operators whose work is same.
(a != b) is equivalent to !(a == b) (a > b) equivalent to (b < a) (a <= b) equivalent to !(b < a)
Time Complexity : The time complexity of the above operation is O(n) where n is the size of the array.
Below is the code to illustrate the working of relational operators on array
Program 1: Relational Operator Comparison
a is greater than equal to b b is less than c a is neither greater than nor equal to c
Program 2: Relational Operator Equality
a is not equal to b b is not equal to c a is equal to c
- Comparing String objects using Relational Operators in C++
- Set a variable without using Arithmetic, Relational or Conditional Operator
- Difference between Relational operator(==) and std::string::compare() in C++
- Operators in C / C++
- Bitwise Operators in C/C++
- Unary operators in C/C++
- unordered_set operators in C++ STL
- What are the operators that can be and cannot be overloaded in C++?
- Advanced C++ | Conversion Operators
- How to sum two integers without using arithmetic operators in C/C++?
- Execution of printf with ++ operators
- static_cast in C++ | Type Casting operators
- new and delete operators in C++ for dynamic memory
- Overloading stream insertion (<>) operators in C++
- reinterpret_cast in C++ | Type Casting operators
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : shubham_singh