anjaly grace

Can anybody help me with permutation in c++. say if the entered string is "stop" then there must be 24 (=4*3*2*1) different words made by the letters s,t,o,p. Similarly if the entered string is "abcde" then there will be 120 (=5*4*3*2*1) different words made using the letters a,b,c,d,e. Please Help. …

[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; …

Hey guys, I have implemented the Knuth Morris Pratt algorithm and wanted to share the C code with all of you. If you feel it can be optimized please let me know. Feel free to play with it or use it for your school work :icon_biggrin: *************************KMP****************************** [code=c] #include<stdio.h> #include<string.h> …

//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 …

Hi guys (again), Another exercise in Turbo Pascal about linked lists. [COLOR="Green"][B] Write a program that merges 2 linked lists and sorts elements from the lowest to the greatest. let suppose the list has this elements list = ^pointer; pointer = record value:integer; next:list; end;[/B][/COLOR] Please help, I have an …