After 100 unsuccessful trial on sorting of a link list finally I can perform any type of sorting algorithm on link lists…………………………………… RCS file: creat_list.c,v Working file: creat_list.c head: 1.4 branch: locks: strict access list: symbolic names: keyword substitution: kv … Continue reading →

RCS file: linklist.c,v Working file: linklist.c head: 1.18 branch: locks: strict sanjaysingla: 1.18 access list: symbolic names: keyword substitution: kv total revisions: 18; selected revisions: 18 description: Here we make a linklist(). In this we take a value of choice … Continue reading →

RCS file: mdc.c,v Working file: mdc.c head: 1.3 branch: locks: strict emblogic: 1.3 access list: symbolic names: keyword substitution: kv total revisions: 3; selected revisions: 3 description: Created Masterarray. Found the code length. —————————- revision 1.3 locked by: emblogic; date: … Continue reading →

RCS file: mdc.c,v 3 Working file: mdc.c 4 head: 1.5 5 branch: 6 locks: strict 7 access list: 8 symbolic names: 9 keyword substitution: kv 10 total revisions: 5;     selected revisions: 5 11 description: 12 Unique array and codelength areprinted … Continue reading →

Pointers Pointers are just variables like any other variables we declare, the only difference is that, the so called normal variables store some sort of data like an integer,a character,a floating point number, on the other hand a pointer stores … Continue reading →

head 1.5; access; symbols; locks ashish:1.5; strict; comment @ * @; 1.5 date 2015.03.23.13.44.10; author ashish; state Exp; branches; next 1.4; 1.4 date 2015.03.23.13.42.03; author ashish; state Exp; branches; next 1.3; 1.3 date 2015.03.23.13.40.25; author ashish; state Exp; branches; next … Continue reading →

head 1.8; access; symbols; locks ashish:1.8; strict; comment @ * @; 1.8 date 2015.03.23.13.36.10; author ashish; state Exp; branches; next 1.7; 1.7 date 2015.03.23.13.34.43; author ashish; state Exp; branches; next 1.6; 1.6 date 2015.03.23.13.33.26; author ashish; state Exp; branches; next … Continue reading →

#include<stdio.h> 2 #include<stdlib.h> 3 int input(int,int *); 4 int search(int *,int,int); 5 int main() 6 { 7 8         int size=10; 9         int * ptr; 10         int i,c,s,key; 11         ptr=(int*)malloc(sizeof(int)*size); 12         c=input(size,ptr); 13         printf(“\n matrix printed are:”); 14         for(i=0;i<size;i++) 15         { … Continue reading →

RCS file: mularray.c,v Working file: mularray.c head: 1.2 branch: locks: strict jyotisingh: 1.2 access list: symbolic names: keyword substitution: kv total revisions: 2;    selected revisions: 2 description: input matrix a input matrix b logic for multiplication print matrix —————————- revision … Continue reading →

RCS file: 14.c,v Working file: 14.c head: 1.1 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: This is the base file for the program. HERE STRING IS CONVERTED INTO INTEGER. AFTER … Continue reading →

head 1.2; access; symbols; locks root:1.2; strict; comment @ * @; 1.2 date 2015.02.28.09.26.43; author root; state Exp; branches; next 1.1; 1.1 date 2015.02.27.12.00.41; author root; state Exp; branches; next ; desc @@ 1.2 log @this program is about binary … Continue reading →

head 1.2; access; symbols; locks root:1.2; strict; comment @ * @; 1.2 date 2002.01.01.01.04.00; author root; state Exp; branches; next 1.1; 1.1 date 2002.01.01.00.56.25; author root; state Exp; branches; next ; desc @used tem variable to interchange the position. array … Continue reading →

#include<stdio.h> #define SIZE 10 int main() { int i,arr[SIZE],key; int l=0,h=SIZE-1,m; printf(“Enter the numbers in array\n”); for(i=0;i<SIZE;i++) { scanf(“%d”,&arr[i]); } printf(“Enter the key”); scanf(“%d”,&key); while(l<=h) { m=(l+h)/2; if(key==arr[m]) { printf(“Element %d is found at %d position”,key,m); break; } else if(key<arr[m]) … Continue reading →