#include <stdio.h>

void bubbleSortInc(double array[])
{
	int i, j, n = 0;
	double temp;

	while(array[n])
	{
		n++;
	}

	for(i = n - 1; i > 0; i--)
	{
		for(j = 1; j <= i; j++)
		{
			if(array[j - 1] > array[j])
			{
				temp = array[j - 1];
				array[j - 1] = array[j];
				array[j] = temp;
			}
		}
	}
}

void bubbleSortDec(double array[])
{
	int i, j, n = 0;
	double temp;

	while(array[n])
	{
		n++;
	}

	for(i = n - 1; i > 0; i--)
	{
		for(j = 1; j <= i; j++)
		{
			if(array[j - 1] < array[j])
			{
				temp = array[j - 1];
				array[j - 1] = array[j];
				array[j] = temp;
			}
		}
	}
}

int binSearch(double array[], double x)
{
	int start, half, end, n = 0;

	while(array[n])
	{
		n++;
	}

	start = 0;
	end = n - 1;

	while(start <= end)
	{
		half = (start + end) / 2;

		if(x < array[half])
		{
			end = half - 1;
		}

		else if(x > array[half])
		{
			start = half + 1;
		}

		else
		{
			return half;
		}
	}

	return -1;
}

Sort And Search Lib

SortAndSearchLib

C