Code Snippets

C Source Code

Welcome to Dream.In.Code
	Become an Expert! Join 340,098 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 4,826 people online right now. Registration is fast and FREE... Join Now! Chat LIVE With a Expert

Bucket Sort

Bucket Sort demo containing reuseable methods for bucket sorting arrays. The program uses the bucketsort methods on 100 arrays each of 100 pieces of data and prints whether the search key is found or not each time. Also prints the arrays to check the programme is working correctly

Submitted By: Ellie

Actions:

Rating:

Views: 7,509

Language: C

Last Modified: January 30, 2007

Snippet

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
const int RANGE = 200; //range for random numbers in the array
enum SearchResult {
FOUND,
NOT_FOUND
};
void initLookupTable(enum SearchResult lookup[], int array[], int sizeOfData, int RANGE)
{
int v;
for(int m=0; m<RANGE; m++)
{
lookup[m] = NOT_FOUND;
}
for(int mm=0; mm<sizeOfData; mm++)
{
v = array[mm];
lookup[v] = FOUND;
}
}
enum SearchResult searchLookupTable(enum SearchResult lookup[], int key)
{
return lookup[key];
}
void fill_array(int array[], int sizeOfData)
{
for (int i = 0; i<=sizeOfData; i++)
{
array[i] = rand() % RANGE;
}
}
void print_array(int array[], int sizeOfData)
{
for (int j = 0; j<=sizeOfData; j++)
{
printf("Item %d is %d\t", j, array[j]);
}
}
int main()
{
srand ( time (0) );
for (int ij=0; ij <100; ij++)
{
const int arraySize = 100;
int a [arraySize];
enum SearchResult lookup[RANGE];
enum SearchResult result;
int searchKey = rand() % RANGE;
fill_array(a, arraySize);
print_array(a, arraySize);
initLookupTable(lookup, a, arraySize, RANGE);
result = searchLookupTable(lookup, searchKey);
if (result == FOUND)
printf("\nKEY %d FOUND \n", searchKey);
else
printf("\nKEY %d NOT FOUND \n", searchKey);
}
return (0);
}

Copy & Paste

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

const int RANGE = 200; //range for random numbers in the array

enum SearchResult {
     FOUND,
     NOT_FOUND
     };

void initLookupTable(enum SearchResult lookup[], int array[], int sizeOfData, int RANGE)
{
int v;
for(int m=0; m<RANGE; m++)
{
lookup[m] = NOT_FOUND;
}

for(int mm=0; mm<sizeOfData; mm++)
{
v = array[mm];
lookup[v] = FOUND;
}

}

enum SearchResult searchLookupTable(enum SearchResult lookup[], int key)
{
return lookup[key];
}
void fill_array(int array[], int sizeOfData)
{

for (int i = 0; i<=sizeOfData; i++)
{
array[i] = rand() % RANGE;
}
}
void print_array(int array[], int sizeOfData)
{
for (int j = 0; j<=sizeOfData; j++)
{
printf("Item %d is %d\t", j, array[j]);
}
}

int main()
  {
        srand ( time (0) );

for (int ij=0; ij <100; ij++)
    {
     const int arraySize = 100;
     int a [arraySize];
     enum SearchResult lookup[RANGE];

enum SearchResult result;

int searchKey = rand() % RANGE;

fill_array(a, arraySize);
     print_array(a, arraySize);

initLookupTable(lookup, a, arraySize, RANGE);

result = searchLookupTable(lookup, searchKey);
     if (result == FOUND)
        printf("\nKEY %d FOUND \n", searchKey);
     else
        printf("\nKEY %d NOT  FOUND \n", searchKey);
  }
  return (0);
}