sarah palin

Palin at the 2010 Time 100 Gala
9th Governor of Alaska
In office December 4, 2006 – July 26, 2009
Lieutenant	Sean Parnell
Preceded by	Frank Murkowski
Succeeded by	Sean Parnell

Bubble sort

#include <stdio.h>
#include <conio.h>
void main( )

Selection Sort

#include <stdio.h>
#include <conio.h>
void main( )

Insertion sort

#include <stdio.h>
#include <conio.h>
void main( )

Binary Tree Sorting

#include <stdio.h>
#include <conio.h>
#include <alloc.h>

Heap Sort

#include <stdio.h>
#include <conio.h>
void makeheap ( int [ ], int ) ;

Merge Sort

#include <stdio.h>
#include <conio.h>

Program to implements depth first search algorithm

#include <stdio.h>
#include <conio.h>
#include <alloc.h>

breadth first search algorithm

#include <stdio.h>
#include <conio.h>
#include <alloc.h>

program to find shortest path

#include <stdio.h>
#include <conio.h>

dijkstra's shortest path algorithm

/* pgm to implement dijkstra's shortest path algorithm*/
#include<stdio.h>
#define INF 1000

Quick sort

#include<stdio.h>
void split(int a[],int lb,int ub,int *pivot)

program to minimum spanning tree using prim's algorithm

*PGM to build minimum spanning tree using prim's algorithm*/
#include<stdio.h>
#define INF 1000

program to pgm to count no. of palindrome in the words

/* pgm to count no. of palindrome in the words*/
#include<stdio.h>
#include<conio.h>

bindary search tree

/* pgm to build optimal bindary search tree*/
#include<stdio.h>
#define INF 10000

NQUEEN PROBLEM

#include<stdio.h>
void main()
{
int i,k=0,n,row[15],ddiag[20],udiag[20];
int board[15],r,j;
clrscr();

program to find the minimum and maximum no. in the list

/* program to find the minimum and maximum no. in the list*/
#include<stdio.h>
int minimum(int a[],int n)
{
int k;

Data Structure minimum spanning tree

/*pgm to find minimum spanning tree using kruskal's algorithm*/
#include<stdio.h>
#define INF 1000
char vertex[10];
int wght[10][10];

Data Structure Knapsack Problem

/* Knapsack Problem Using Backtracking*/
#include<stdio.h>
int x[12],w[12],pr[12],m,n,z,val;
void main()
{

Data Structure factorial & generate fibonacci series

/* pgm to compute factorial & generate fibonacci of a number*/
#include<stdio.h>
long int fact(int);
int fibo(int);
void main()

Data Structure binary search

/* program to search an element using binary search method*/
#include<stdio.h>
void sort(int a[],int n)

Data Structure Travelling Salesman program

/* Travelling Salesman Problem using backtracking*/
#include"stdio.h"
int x[15],used[15];
int adj[15][15]={0};
int path[15][15],wght[15];
int c,min;
int path_ok(int k,int n)