Bucket Sort:

#include <iostream.h>

class element            //element 

{

public:

      int value;

      element *next;

      element()

      {

      value=NULL;

      next=NULL;

      }

};

class bucket           //bucket containing a perticular range of values    

{

public:

element *firstElement;

bucket()

{

firstElement = NULL;

}

};

void main()                     

{

      int lowend=0;         // minimum element 

      int highend=100;      //max element  

          int interval=10;      //number of intervals