Last Class Quiz - Working with Hash Table, C++ (clang)

Last Class Quiz - Working with Hash Table

Language: Layout:

//clang 3.8.0

#include  <stdio.h>
#include <unordered_map>
#include <cstdlib>
#include <utility>
#include <string>
#include <iostream>

using namespace std;

int main(void)
{
    
    unordered_map<string, char> myMap; 
    
    //Here I show how you can insert things into the map

char value; 
    for(int i = 0; i < 26; i++){
        
        string key = "key_" + to_string(i); 
        value = 65 + (i % 26); 
    
        
        myMap.insert({key, value}); 
    }
    
      unordered_map<string, char>::const_iterator got; 
        
    
    for(int i = 0; i < 26; i++){
        
        string key = "key_" + to_string(i); 
        
         got = myMap.find(key); 
        //lookup elements
        cout << "Key: key_" << i << " Value: " << got->second << endl; 
        
    }
    
    cout << endl; 
    
    //Determine an item is not in the hash table
    for(int i  = 20; i < 29; i++){
       
        string key = "key_" + to_string(i);
        cout << "Testing key: " << key; 
        
        if(myMap.count(key)){
            cout << " Item in hash table!" << endl; 
        }
        else{
            cout << " Not in hash table!" << endl; 
        }
       
    }
    
    cout << endl; 
    
    //Print contents of the Hash Table
    for( got = myMap.begin(); got != myMap.end(); got++){
        
        cout << "Key: " << got->first << " Value: " << got->second << endl; 
    }
    
      
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1.33 sec, absolute running time: 0.08 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 1,42 sec

Key: key_0 Value: A Key: key_1 Value: B Key: key_2 Value: C Key: key_3 Value: D Key: key_4 Value: E Key: key_5 Value: F Key: key_6 Value: G Key: key_7 Value: H Key: key_8 Value: I Key: key_9 Value: J Key: key_10 Value: K Key: key_11 Value: L Key: key_12 Value: M Key: key_13 Value: N Key: key_14 Value: O Key: key_15 Value: P Key: key_16 Value: Q Key: key_17 Value: R Key: key_18 Value: S Key: key_19 Value: T Key: key_20 Value: U Key: key_21 Value: V Key: key_22 Value: W Key: key_23 Value: X Key: key_24 Value: Y Key: key_25 Value: Z Testing key: key_20 Item in hash table! Testing key: key_21 Item in hash table! Testing key: key_22 Item in hash table! Testing key: key_23 Item in hash table! Testing key: key_24 Item in hash table! Testing key: key_25 Item in hash table! Testing key: key_26 Not in hash table! Testing key: key_27 Not in hash table! Testing key: key_28 Not in hash table! Key: key_25 Value: Z Key: key_24 Value: Y Key: key_23 Value: X Key: key_22 Value: W Key: key_21 Value: V Key: key_6 Value: G Key: key_10 Value: K Key: key_20 Value: U Key: key_15 Value: P Key: key_14 Value: O Key: key_13 Value: N Key: key_18 Value: S Key: key_12 Value: M Key: key_2 Value: C Key: key_9 Value: J Key: key_8 Value: I Key: key_7 Value: H Key: key_5 Value: F Key: key_4 Value: E Key: key_17 Value: R Key: key_0 Value: A Key: key_19 Value: T Key: key_16 Value: Q Key: key_1 Value: B Key: key_3 Value: D Key: key_11 Value: L