C++ Tutorial Index

C++ Tutorial C++ History C++ Installation C++ First Program C++ cin and cout C++ Data type C++ Variable C++ operator C++ Keywords

C++ Control Statements

C++ If C++ Nested if C++ If-else C++ If-else-if C++ Switch C++ Break C++ Continue C++ Goto C++ For loop C++ While loop C++ Do while loop

C++ Functions

C++ Call by Value C++ Call by Reference C++ Recursion Function C++ Inline function C++ Friend function

C++ Arrays

Single dimension array Two dimension array

C++ Strings

C++ Strings

C++ Inheritance

C++ Inheritance Single level Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance

C++ Polymorphism

C++ Polymorphism C++ Overloading C++ Overriding C++ Virtual Function

C++ Pointers

C++ Pointers C++ this pointer

C++ Exception Handling

C++ Exception Handling

C++ Constructors

C++ Constructors Default Constructor Parameterize Constructor Copy constructor Constructor Overloading Destructor

C++ File Handling

C++ File Handling C++ Writing to file C++ Reading file C++ Close file

Miscellaneous

C Vs C++ C++ Comments C++ Data Abstraction C++ Identifier C++ Memory Management C++ Storage Classes C++ Void Pointer C++ Array To Function C++ Expressions C++ Features C++ Interfaces C++ Encapsulation std::min in C++ External merge sort in C++ Remove duplicates from sorted array in C++ Precision of floating point numbers Using these functions floor(), ceil(), trunc(), round() and setprecision() in C++ C++ References C++ Friend Functions C++ Mutable keyword Unary Operators in C++ Initialize Array of objects with parameterized constructors in C++ Differences between #define & const in C/C++ C++ Program to Implement Shell Sort C++ Program to Implement Merge Sort Storage Classes in C Vector resize() in C++ Passing by Reference Vs. Passing by the pointer in C++ Free vs delete() in C++ goto statement in C and C++ C++ program to read string using cin.getline() C++ String Concatenation Heap Sort in C++ Swap numbers in C++ Input Iterators in C++ Fibonacci Series in C++ C ++ Program: Alphabet Triangle and Number Triangle C++ Program: Matrix Multiplication C++ Program to Print Fibonacci Triangle Stack in C++ Maps in C++ Queue in C++ C++ Bitset C++ Algorithms Priority Queue in C++ C++ Multimap C++ Deque Function Pointer in C++ Sizeof() Operators in C++ C++ array of Pointers free() Vs delete in C Timsort Implementation Using C++ CPP Templates C++ Aggregation C++ Enumeration C++ Math Functions C++ Object Class C++ Queue Initialize Vector in C++ Vector in C++ C++ STL Components Function overloading in C++ C++ Maximum Index Problem C++ find missing in the second array C++ Program to find the product array puzzle C++ Program To Find Largest Subarray With 0 Sum C++ Program To Move All Zeros To The End Of The Array C++ Program to find the element that occurs once C++ Program to find the largest number formed from an array Constructor Vs Destructor C++ Namespaces C++ OOPs Concept C++ Static C++ Structs C++ Try-Catch C++ User Defined Exceptions C++ Virtual Destructor C++ vs C# Malloc() and new in C++ Palindrome Number Program in C++ Snake Code in C++ Splitting a string in C++ Structure Vs Class in C++ Virtual Function Vs Pure Virtual Function C++ Bidirectional Iterators C++ Forward Iterators C++ Iterators C++ Output Iterators C++ Range-based For Loop Converting string into integer in C++ LCM Program in C++ Type conversion in C++ Add two numbers using the function in C++ Advantage and disadvantage friend function C++ Armstrong Number Program in C++ ATM machine program in C++ using functions Binary to Decimal in C++ Bit Manipulation in C++ C++ Constructor C++ Dijkstra Algorithm Using the Priority Queue C++ int into String C++ Signal Handling Decimal to Binary in C++ Decimal to Hexadecimal in C++ Decimal to Octal in C++ Factorial Program in C++ Function in C++ Hexadecimal to Decimal in C++ Octal to Decimal in C++ Reverse a Number in C++ Structure Vs Class in C++ C++ Forward Iterators C++ Output Iterators C++ Prime number program Char Array to String in C++ Constructor Overloading in C++ Default arguments in C++ Different Ways to Compare Strings in C++ Dynamic Binding in C++ Program to convert infix to postfix expression in C++ SET Data Structure in C++ Upcasting and Downcasting in C++ Reverse an Array in C++ Fast Input and Output in C++ Delete Operator in C++ Copy elision in C++ C++ Date and Time C++ Bitwise XOR Operator Array of sets in C++ Binary Operator Overloading in C++ Binary Search in C++ Implementing the sets without C++ STL containers Scope Resolution Operator in C++ Smart pointers in C++ Types of polymorphism in C++ Exception Handling in C++ vs Java Const Keyword in C++ Type Casting in C++ Static keyword in C++ vs Java Inheritance in C++ vs Java How to concatenate two strings in C++ Programs to Print Pyramid Patterns in C++ swap() function in C++ Structure of C++ Program Stringstream in C++ and its applications rand() and srand() in C / C++ C++ Ternary Operator C++ Scope of Variables While Loop Examples in C++ Star pattern in C++ using For Loops For Loop Examples in C++ Do-While Loop Examples in C++ Top 5 IDEs for C++ That You Should Try Once Assertions in C/C++ C++ Convert Int to String Continue in C++ While loop Diamond Pattern in C++ using For Loop How to Reverse a String in C++ using Do-While Loop How to Reverse a String in C++ using For Loop How to Reverse a String in C++ using While Loop Infinite loop in C++ Loops in C++ Returning Multiple Values from a Function using Tuple and Pair in C++ wcscpy(), wcslen(), wcscmp() Functions in C++ Auto keyword in C++ C++ 11 vs C++ 14 vs C++ 17 C++ STL (Standard Template Library) Differences Between C Structures and C++ Structures Divide by Zero Exception in C++ Dynamic Constructor in C++ Dynamic Memory Allocation in C++ Find the Size of Array in C/C++ without using sizeof() function Floating Point Operations and Associativity in C, C++ and Java Hello World Program in C++ How to create a table in C++ How to Setup Environment for C++ Programming on Mac Implementation of a Falling Matrix in C++ Message Passing in C++ Pointer to Object in C++ Templates in C++ vs Generics in Java Ways to Copy a Vector in C++ What does Buffer Flush mean in C++ sort() function in C++ Structure Sorting (By Multiple Rules) in C++ Similarities between C++ and Java std::distance in C++

SET Data Structure in C++

Generally, in our home, we store food items in a fridge or kitchen efficiently to find them easily and use them. Similarly, in programming, we need to store the data efficiently so we can access the data efficiently for this we use data structures.

Data Structures

Data structures are a way of collecting and organizing data so that we can work with it effectively. A data structure is the rendering(arrangement) of a data item from a relationship perspective to organize better and store the data item. For example, there is data where the player's name is "Mayank Agarwal," and the age is 36. "Mayank Agarwal" is a string data type, and 36 is an integer data type. This data may be organized as a record, such as a cricket record, containing the player's name and age. We can now collect cricket records and save them as a data structure in a file like a table or a database.

Data structures can be divided into two main types. One is a built-in data structure, and the other is a user-defined data structure.

Major Types Data Structure

SET Data Structure In C++

The built-in data structures are divided into four subtypes, one of which is an integer, floating-point, character, and pointer. User-defined data structures can be divided into three types: arrays, lists, and files. Lists can be divided into two types: linear lists and non-linear lists. The linear list is divided into stacks and queues. Non-linear lists are divided into trees and charts.

Built In Data Structure

SET Data Structure In C++

User Defined Data Structure

SET Data Structure In C++

SET

First, a set is an associative container that stores unique elements. In sets, duplicates are not allowed. Here elements own identify themselves means whether the elements are unique or not it is identified by their self. In a set, addition is possible, but modification is not possible. The important thing is we cannot modify the set.

SET Data Structure In C++

The set will get printed in the sorted order. We can also print in reverse order.

SET in reverse order

This is the command we need to write to print the set-in reverse order

set<int, greater<int>>s;

Types of sets

SET Data Structure In C++

Set is self-balancing BST (Binary search tree). In the sorted list, the time complexity is O(log n).

Unordered set

Implementation is different here as the elements are not sorted. The worst-case complexity is O(n).

Features of Set

A set is a data structure storing unique elements of the same type in sorted order. All values are keys. That is, access all values ??through the value itself. On the other hand, in the case of an array, each value is accessed by the position (index) in the container. Therefore, each value in the set must be unique.

Now let us look into the implementation part.

Creating an empty set In C++

#include <iostream>
 #include <set> 
using namespace std;
 int main ()
 {
 set<int> newset; 
}

Output:

Here the output is empty as we created empty list and we did not even display it. Now let us create another set which is collection of integers.

Creating a full set in C++

#include <iostream>
 #include <set> 
using namespace std;
 int main ()
 {
set<int> fullset{11,22,33,44};
set<int>::iterator it; 
for (it=fullset.begin(); it!=fullset.end(); ++it)
 cout << ' ' << *it;
 cout << '\n';


}

OUTPUT:

SET Data Structure In C++

Here output is 11,22,33 and 44 we declared these elements in the set itself.

Now let us insert elements into empty set.

Inserting Into Set

We need to use insert keyword in order to do it.

include <iostream>
#include <set> 
using namespace std;
 int main ()
 {
set<int> emptyset;


emptyset.insert(9);
emptyset.insert(19);
emptyset.insert(29); 
emptyset.insert(39);


set<int>::iterator it; 
for (it=emptyset.begin(); it!=emptyset.end(); ++it)
 cout << ' ' << *it;
 cout << '\n';


}

Here we inserted step by step 4 elements so elements are 9,19,29, 39 respectively.

Output

SET Data Structure In C++

Deleting

To delete one element from set we need to use erase command.

setname.erase()

CODE

#include <iostream>
#include <set> 
using namespace std;
 int main ()
 {
set<int> emptyset;


emptyset.insert(9);
emptyset.insert(19);
emptyset.insert(29); 
emptyset.insert(39);


set<int>::iterator it; 
for (it=emptyset.begin(); it!=emptyset.end(); ++it)
 cout << ' ' << *it;
 cout << '\n';
emptyset.erase(19);
set<int>::iterator it2; 
for (it2=emptyset.begin(); it2!=emptyset.end(); ++it2)
 cout << ' ' << *it2;
 cout << '\n';




}

Output:

SET Data Structure In C++

Deleting multiple elements

Using pointers, we can delete set of elements, we need to mention the beginning and ending.

#include <iostream>
#include <set> 
using namespace std;
 int main ()
 {
set<int> emptyset;


emptyset.insert(9);
emptyset.insert(19);
emptyset.insert(29); 
emptyset.insert(39);


set<int>::iterator it; 
for (it=emptyset.begin(); it!=emptyset.end(); ++it)
 cout << ' ' << *it;
 cout << '\n';
 //Deleting mutiple elements 
 emptyset.erase(emptyset.find(19), emptyset.end());
set<int>::iterator it2; 
for (it2=emptyset.begin(); it2!=emptyset.end(); ++it2)
 cout << ' ' << *it2;
 cout << '\n';
}

Output

SET Data Structure In C++

Displaying

In order to display elements of list in C++, we need to use these commands.

We need to use iterator to display all elements one by one.

Full Example

CODE:

#include <iostream>       
#include <set>          
using namespace std;
int main ()
{
    //Now we created an empty set name "emptyset"
    set<int> emptyset;
   
    // adding sinle elements
    emptyset.insert(9);
    emptyset.insert(29);
    emptyset.insert(39);
    emptyset.insert(49);
   
    // Now let us create a copy of set in order to undersatnd in the better way
    set<int> nineset(emptyset);
     
    // Now let us delete single element from the set 
    nineset.erase(9);
   
    // now delete elements using pointers 
    nineset.erase(nineset.find(39), nineset.end());
      // print elements
    set<int>::iterator it;
    for (it=nineset.begin(); it!=nineset.end(); ++it)
      cout << ' ' << *it;
    cout << '\n';


   
   
    // clear set using pointers
    nineset.erase(nineset.begin(), nineset.end());
   
    // clear set using clear
    nineset.clear();
}

Output

SET Data Structure In C++

This is the full code from designing emty set to filled set and deleting elements.

Applications of Set

The following are the applications of set

1. The use of the kit may not be ideal. Consider using a card if the key-value store may work better than the key alone. Another option is to use a set of pairs if you need to store the two values together as a unit.

2. When we should avoid using sets is when you access elements by position in the data structure rather than by the value itself. In this case, vectors are a more practical option.

Major Differences between ordered and unordered set

1. In an ordered or sort list, the elements will be processed in increasing order which is by default, whereas in an unordered set, there is no place for ordering.

2. Sorted set is self-balancing BST similar to red black tress, but unordered set follows the hash table.

3. The search time in the ordered list is log(n), whereas for the unordered list d set, the average time complexity is O(1), and the worst case is O(n). So when we compare in average case unordered list is a little bit better than the ordered list

4. The insertion time in the ordered set is {log(n)+Rebalance} whereas, in the unordered set, it is the same as search.

5. The deletion time in the order set is {log(n)+Rebalance} whereas, in the unordered set, it is the same as search.



ADVERTISEMENT
ADVERTISEMENT