murikadan

void sort(char **w,int count)
{
    int i,j;
    for(i=0;i<count;i++)
		for(j=0;j<count-i-1;j++)
			if(strcmp(w[j],w[j+1])>0)
			{
				char *temp=w[j];
				w[j]=w[j+1];
				w[j+1]=temp;

murikadan

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

struct node
{
	int val;
	struct node* next;
};

void enqueue(struct node**,struct node **,int);

murikadan

void stringgen(char *c)
{
    int i=0,j=0,l;
    l=strlen(c);
    while(l>=1)
    {
        for(i=0;i<l;++i)
	{
            char *buf=malloc(sizeof(char)*(i+2));
            for(j=0;j<=i;j++)

murikadan

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

struct node
{
	int val;
	struct node* next;
};

void enqueue(struct node**,struct node **,int);

murikadan

void writestring(char *);
void writedigit(int);
void writestring(char *s)
{
	FILE *fp;
	char nl[]="\n";
	fp=fopen("output","a");
	fprintf(fp,"%s",nl);
	fprintf(fp,"%s",s);
	fclose(fp);

murikadan

4
1
2
3
4
5
6
7
8
9

murikadan

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

struct bst
{
	struct bst *left,*right;
	int val;
};

struct bst* makenode(int);

murikadan

10
5
7
3
0
9
8
2
1
6

murikadan

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

struct node
{
	char *val;
	struct node *next;
};
	

murikadan

int binsearch(int *,int,int,int);
int binsearch(int *a,int low,int high,int key)
{
    while(high>=low)
    {
        int mid=(low+high)/2;
        if(a[mid]==key)
            return 1;
        else if(a[mid]>key)
            high=mid-1;