Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Set find() function in C++ STL
Set find() function in C++ STL returns an iterator to the element which is searched in the set container. The iterator points to the position just after the last element in the set, if the element is not found.
Algorithm
Begin Define function printS() to print elements of set container. initialize an empty set container s. Insert some elements in s set container. Call function to print elements of set container. Call the set find() function to find an element from s set container. If element is in the set then Print elememt is in the set. Else Print element is not in the set. End.
Example Code
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> s;
set<int>::iterator it;
s.insert(7);
s.insert(6);
s.insert(1);
s.insert(4);
s.insert(2);
s.insert(9);
s.insert(10);
auto pos = s.find(6);
cout << "The set elements after 6 are: ";
for ( it = pos; it != s.end(); it++)
cout << *it << " ";
return 0;
}Output
The set elements after 6 are: 6 7 9 10
Updated on: 30-Jul-2019
413 Views
Advertisements