anjaly grace

[code=cplusplus] //This is a copy of another answer. It works for Turbo c++ 1. #include<iostream.h> #include<string.h> #include<conio.h> int count=0; void permut(char stra1[],char append[]) { int length = strlen(stra1); if (length) { for(int i=0;i<length;++i) { char* str2 = new char[length+1]; int count1; int count2; for(count1=0,count2=0; count1<length; ++count1,++count2) { if (count1 == …

[code=cplusplus] //////This is a copied code for insertion sort ///// It works for turbo c++ 1 ///// in windows. /// For students of nitc. // The program takes in size of array, and elements and sorts it. #include <iostream.h> #include<conio.h> //#define size 6 void insertion_sort(int x[],int length) { int key,i; …

[code] //this is a c++ code, not dynamic memory allocation. //for nitc students (who might use it in 2010) #include<iostream.h> #include<conio.h> #include<string.h> void kmp(); void time(char p[]); void kmp(); char p[100],s[100]; int t[100]; int m; int main() { clrscr(); cout<<"enter string"<<endl; cin>>s; cout<<"enter pattern"<<endl; cin>>p; m=strlen(p); kmp(); getch(); return (0); …

//This code works for turbo c++ //Solution for strongly connected components or Kosaraju's algorithm //for nitc students //I use this because there is no other way i know how to do post a //code. ///////code:- #include<iostream.h> //#include<math.h> #include<conio.h> //int time; //time=0; char color[10]; int s[10]; int f[10]; int nn; int …

merge sort in link list. Works in g++/c++ by deleting // 's #include<iostream> using namespace std; //#include<conio.h> #include<stdio.h> #include<malloc.h> struct node { int number; struct node *next; }; struct node *adnode(int number, struct node *next);//Adding new node struct node *mergesort(struct node *head); //spliting link list using 2 pointers struct node …