#include<stdio.h>
#include<conio.h>
void soft(int *,int *);
void main()
{
int a[30],n;
printf("enter the number of elements going to enter :");
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",a[i]);
soft(a);
printf("the second maximum in the given array is :");
getch();
}
void soft(int *a,int *n);
{
 int temp;
for(int i=0;i<(*n);i++)
  {
    for(j=0;j<(*n);j++)
       { 
         if(a[j+1]<a[j])
          {
             temp=a[j+1];
       a[j+1]=a[j];
     a[j]=temp;
}
}
}
printf("%d",a[n-1]);
}

sorry i dont know the concept of hash table!!!!!!!!!!!!!!!

#include <stdio.h>

int main ( int argc, char* argv[] )
{

	int* array_int, nTotalCount = 10, sbig, big, i;
	printf ( "\n/********************** Second Biggest 
Number ********************/" );
	array_int = ( int* ) malloc ( nTotalCount * sizeof 
( int ) );

	for ( i = 0; i < nTotalCount; i++ )
		array_int [i] = rand() % 100;

	printf( "\nThe Numbers in given order" );
	for ( i = 0; i < nTotalCount; i++ )
		printf ( "\t%d", array_int [i] );

	for ( i = 0; i < nTotalCount; i++ )
	{
		switch ( i )
		{
			case 0:
				sbig = big = array_int [i];
				break;
			default:
				if ( big < array_int [i] ) {
					sbig = big;
					big = array_int [i];
				} else {
					if ( sbig < 
array_int [i] ) sbig = array_int [i] ;
				}
				break;
		}
	}
	printf ( "\n sbig :%d big :%d", sbig, big );

	free ( array_int );
}


For hashtable please refer the following link
http://www.geocities.com/abdur_rab7/Open_Hash/openhash.html

1.#include<stdio.h>
int main()
{
    int a[10]={222,111,4,5,6,8,1,77,0,4};
    int i=0,max=0,sec_max=0;
    
    for(i=0;i<10;i++)
    {
       if(a[i]>max)
       {
         sec_max=max;
         max=a[i];	
       }
       else if(a[i]>sec_max)
       {
       	  sec_max=a[i];
       }
       	
    	
    }
    
printf("Max= %d  Second Max=%d",max,sec_max);
    
}

#include<stdio.h>

int main()
{
        int arr[] = {2,3,20,7,8,1};
        int max, sec;
        int i;
        max=0;
        sec=0;
        for ( i=0; i< 6; i++)
        {
                if(arr[i] > max)
                max = arr[i];
        }

        for ( i=0; i< 6; i++)
        {
                if ( (arr[i] > sec) && (arr[i] < max))
                        sec = arr[i];
        }
        printf(" max=%d\n sec=%d\n", max, sec);
}

//find second maximum number in given array. 
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[5];
int max=0,secmax=0,i;
cout<<"Enter element";
for(i=0;i<=4;i++)
{
cin>>a[i];
}
for(i=0;i<=4;i++)
{
if(a[i]>max)
{
secmax=max;
max=a[i];
}
if(a[i]>secmax&&a[i]<max)
{
 secmax=a[i];
}
}
cout<<"The max element is="<<max;
cout<<"the sec max is="<<secmax;
getch();
}

1. Selection sort with second pass
2. Basically we create a two dimension array (key, value)
and then we define a hash function to determine position of
elements when we insert/delete.
3. When two elements insert to the same spot in a hash
table, we have a hash collision. H(x1) = H(x2) = y