int main() { unordered_set

int main()
{
unordered_set<int> numbers {1, 100, 10, 70, 100}; cout << "numbers = "; for(auto &num: numbers) { cout << num << ", ";
}
return 0; }
Natija:
numbers = 70, 10, 100, 1,
5-masala. To’plamga element qo’shish.
#include
#include using namespace std;
int main() {
unordered_set<string> countries;
countries.insert("Nepal");

countries.insert(	{"Nepal", "India", "USA", "Korea"	});

cout << "Countries = "; for(const auto& country: countries) { cout << country << ", ";
} return 0; }
Natija:
Countries = Korea, USA, India, Nepal,
6-masala. To’plamdan element o’chirish.
#include
#include using namespace std;
// function prototype for display_unordered_set() void display_unordered_set(const unordered_set<string> &);
int main() {
unordered_set<string> languages {"C++", "Python", "Java", "PHP"};
cout << "Initial unordered set:\n"; display_unordered_set(languages);
// remove element with value: "Python" languages.erase("Python");
cout << "\n\nFinal unordered set: \n"; display_unordered_set(languages);
return 0;
}
// utility function to print unordered_set elements void display_unordered_set(const unordered_set<string> &uset) { for(const auto& value: uset) { cout << value << ", ";
} }
7-masala. To’plamdan elementni qidirish.
#include
#include using namespace std;
int main() {
unordered_set<int> primes {2, 3, 5, 7, 11, 13};
cout << "Using find():" << endl; cout << "Does number " << 12 << " exist? ";
// find() returns primes.end() if the value is not found if (primes.find(12) != primes.end()) { cout << "Yes";
} else { cout << "No";
}
cout << "\n\nUsing count():" << endl; cout << "Does number " << 7 << " exist? ";
// count() returns 0 if the value doesn't exist if (primes.count(7)) { cout << "Yes";
} else { cout << "No";
}
return 0; }
8-masala. Bo’lish usulini qo’llash orqali xesh-jadvalni to’ldirish.
#include
#include using namespace std;
class HashTable
{
int capacity; list<int> *table;
public:

HashTable(int V); void insertItem(int key, int data); void deleteItem(int key);
int checkPrime(int n)
{
int i;
if (n == 1 || n == 0)
{
return 0;
}
for (i = 2; i < n / 2; i++)
{
if (n % i == 0)
{ return 0;
}
} return 1;
}
int getPrime(int n)
{
if (n % 2 == 0)
{
n++;
}
while (!checkPrime(n))
{
n += 2;
}
return n;
}
int hashFunction(int key)
{
return (key % capacity);
}
void displayHash();
};

HashTable::HashTable(int c)
{ int size = getPrime(c);
this->capacity = size; table = new list<int>[capacity];
}
void HashTable::insertItem(int key, int data)
{
int index = hashFunction(key); table[index].push_back(data);
}
void HashTable::deleteItem(int key)

{
int index = hashFunction(key); list<int>::iterator i; for (i = table[index].begin();
i != table[index].end(); i++)
{
if (*i == key) break;
}
if (i != table[index].end())
table[index].erase(i);
}