Difference between Set and UnOrderSet in C++

C++Server Side ProgrammingProgramming

In C++ both Set and UnOrderSet are the type of data structures which are used to store the data for easy accessing and insertion. On the basis of characteristics of both these data structures we can distinguish between Set and UnOrderSet

Following are the important differences between Set and UnOrderSet −

Sr. No.KeySetUnOrderSet
1DefinitionSet in C++ can be defined as a type of associative container which stores the data in key value pair and in which each value element has to be unique, because the value of the element identifies it.On other hand UnOrderSet are part of the C++ STL (Standard Template Library) and are defined as the associative containers like Set that stores sorted key value pairs, but unlike Set which store data in sorted order UnOrderSet store data not in sorted order.
2SortingIn case of Set data is stored in sorted order.On other hand in case of UnOrderSet the data is not stored in sorted order.
3Duplicate ValuesIn Set duplicate values are not allowed to get stored.On other hand in case of UnOrderSet duplicate values gets discarded.
4ImplementationSets are implemented using Binary Search Tree.However on other hand UnOrderedSet are created using Hash-tables

Example

Set

#include
#include
using namespace std;
main() {
   int data[15] = {11, 55, 22, 66, 33, 22, 11, 44, 77, 88, 66, 99, 66, 23, 41};
   set my_set;
   for(int i = 0; i<15; i++) { my_set.insert(data[i]); }
   set::iterator it;
   for(it = my_set.begin();
   it != my_set.end(); it++) {
      cout << "Item: " << *it << endl;
   }
}

Output

Item: 11 Item: 22 Item: 23 Item: 33 Item: 41 Item: 44 Item: 55 Item: 66 Item: 77 Item: 88 Item: 99

Example

UnOrderSet

#include
#include using namespace std;
main() {
   int data[15] = {11, 55, 22, 66, 33, 22, 11, 44, 77, 88, 66, 99, 66, 23, 41};
   unordered_set my_set; for(int i = 0; i<15; i++) {
   my_set.insert(data[i]);
   }
   unordered_set::iterator it;
   for(it = my_set.begin(); it != my_set.end(); it++) {
      cout << "Item: " << *it << endl;
   }
}

Output

Item: 11
Item: 55
Item: 22
Item: 66
Item: 33
Item: 44
Item: 77
Item: 88
Item: 99
Item: 23
Item: 41
raja
Updated on 09-Jun-2020 09:00:59

Advertisements