关键字插入哈稀表,规则：元素值与桶下标相同

#include <iostream>
using namespace std;

const int INDEX_ZERO = 0;
const int INDEX_ONE = 1;
const int INT_TWO = 2;
const int INT_ZERO = 0;

void display( int *array, int size )
{
     if (NULL == array)
     {
              throw;
     }
     
     for (int i=INDEX_ZERO; i<size; ++i)
     {
         cout << array[i] << " ";
     }
     
     cout << "display is over!" << endl << endl;
}

//将key关键字插入到哈稀表中 

void hash_push( int *array, int size, int key )
{
     if (NULL == array)
     {
              throw;
     }
     
     if (key < size )
     {
             if (INT_ZERO == array[key])
             {
                          cout << "冲突" << endl;
             }
             
             else
             {
                 array[key] = key;//规则：元素值与桶下标相同

             }
     }
     else
     {
         cout << "这个简单的哈稀函数处理不了这么大的数" << endl;
     }
}

int main( void )
{
    const int MAX_SIZE = 128;
    int hashTable[MAX_SIZE] = {INT_ZERO};
    
    int key[] = {20, 5, 8, 7, 23, 18, 27};
    const int KEY_SIZE = sizeof (key) / sizeof (*key);
    for (int i=INDEX_ZERO; i<KEY_SIZE; ++i)
    {
        hashTable[key[i]] = key[i];
    }
    
    display( hashTable, MAX_SIZE );
	
	//访问一个表中的元素 

	cout << hashTable[5] << endl;
	
 	system( "PAUSE" );
 	return EXIT_SUCCESS;
}

/*----------------------
0 0 0 0 0 5 0 7 8 0 0 0 0 0 0 0 0 0 18 0 20 0 0 23 0 0 0 27 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 display is over!

5
请按任意键继续. . .
--------------------------*/