Array help

[computerboy]

I am writing this program that takes a number gives it a hash humber and then put the orginal number in the array spot.

ex. Enter a number: 32
Hash value is 5 so 32 is placed in the 5th spot of the array. If two numbers have the same hash value my program must insert that number in the next available spot. Here is my code. My problem is I can't make the numbers go in a particular arrray location.

#include <iostream>
using namespace std;
struct array{
int num;
int collision;
};

int A[8];

int main()
{
array A[8];
int k;
int number;

for (k = 0; k < 8; k++){
A[k].num=-1;
A[k].collision=0;
}

for (k = 0; k < 8; k++)
{
cout << "Enter eight numbers: ";
cin >> number;
int hash = number % (8 + 1);
if(hash=8)
hash=0;
if(A[hash].num==-1)
A[hash].num=number;
else
{
A[hash].collision++;
for (int l=1; l<=8-hash; l++)
{
if(A[hash+l].num==-1)
{
A[hash+l].num=number;
break;
}
else
A[hash+l].collision++;
}
}
}
for (int i=0; i<8; i++)
{
if(A[i].num!=-1)
cout<<"Number Inserted at Index " << i << " is " << A[i].num << " and " << A[i].collision << " collisions occured at this index." << endl;
}

return 0;
}

[D_C]

if(hash=8)
hash=0;

This code always does the same thing. That is, assigns 8 to hash, then probably 0 to hash. It depends whether we assign hash = 8. Make it

if(hash==8)
  hash = 0;

By the way, it would probably be easier just to do it modulo 8, and possibly multiply your input by a number which is relatively prime to eight (3, 5, or 7).

[Banfa]

Also

for (int l=1; l<=8-hash; l++)
{
if(A[hash+l].num==-1)
{
...
}
}

At it's limit l = 8-hash

then you use it as an array index A[hash+l] == A[hash+8-hash] = A[8]

but A declared as array A[8] so A[8] is an out of bounds array access.