How to implement Hash table in c/c++ ?

Question

I need a fully functional hash table with time complexity for search O(n). Can someone please help me?

Answer 1

The functionality of Hash table can be used by providing c++ map STL,
Program is given below for hash table using map STL

#include<iostream>
#include<map>
#include<string>
#include<utility>
using namespace std;
int main()
{
  string name="neha";
  int empid;

//In map STL string data type is being used as key value and int value their corresponding string value
  map <string,int> employee;
  employee["neha"]=1;
  employee["rajan"]=2;
  employee["ranan"]=3;
  employee["lav"]=4;
  employee["kush"]=5;

  for(map<string,int> ::iterator i=employee.begin();i!=employee.end();i++)
  {
    cout<<(*i).first<<"\t\t"<<(*i).second<<endl;
  }

  map<string,int>:: iterator ii=employee.find(name);
  cout<<ii->second;
  return 0;
}