Programming and Data Structures by Pearson

Non-Linear Data Structure 563

return c ;

}

void disp (int fa r r [] ,in t count)

{

int a l;

fo r (a l= l;al<=count;al++)

p r in t f( "%5d", fa r r [ a l ] );

}

void search(int s a r r[] ,int n ,in t co)

{

int a2;

for (a2=l;a2<=co;a2++)

{

i f (n*=»sarr [a 2 ])

{

p r in t f ("The position of the number is %d H, a 2 );

break;

}

}

>

OUTPUT:

Enter the number of the elements:l 12 123 12345 1234

The length of 1 is:l

The length of 12 is:2

The length of 123 is:3

The length of 12345 is:5

The length of 1234 is:4

The Hash Table is as follows:

Index 1: 1

Index 2: 12

Index 3: 123

Index 4:1234

Index 5: 12345

Enter the number to search: 12345

The position ...