Skip to main content

WRITE AN ALGORITHM TO CIRCULAR SHIFT AN ARRAY

By

LIST OF PROGRAMS


STEP 1  START
STEP 2  READ VALUES IN ARRAY A OF SIZE 100
STEP 3  READ SIZE OF ARRAY IN N
STEP 4  LET C=0,TMP=0
STEP 5  READ VALUE IN A[C]
STEP 6  INCREMENT C BY 1 
STEP 7  IF C<100 THEN GOTO STEP 5  
STEP 8  STORE A[C]IN TMP
STEP 9  C=0
STEP 10 A[C]=A[C+1]
STEP 11 INCREMENT C BY 1 
STEP 12 IF C<99 THEN GOTO STEP 10
STEP 13 A[99]=TMP 
STEP 14 DISPLAY THE ARRAY
STEP 15 STOP 

LIST OF PROGRAMS

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND OCTAL OF A NUMBER

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> void main() { long int n,oct=0,r=1,pow=1;  clrscr(); printf("Enter a number "); scanf("%ld",&n); if(n<0) printf("WRONG INPUT"); else {  if(n<=7&&n>=0)  oct =n;  else  {  while(n>0)  { r=n%8; oct=oct+(r*pow); n=n/8; pow=pow*10;  }  }  printf("OCTAL = %ld",oct);  getch(); } } LIST OF PROGRAMS
2 comments
Read more

PROGRAM TO PERFORM BINARY SEARCH USING RECURSION

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> int binary(int ,int ); int a[10],md,s,c=0; void main() { int n,i; clrscr(); printf("ENTER LIMIT \n"); scanf("%d",&n); printf("ENTER ARRAY\n"); for(i=0;i<n;i++) { fflush(stdin); scanf("%d",&a[i]); } printf("ENTER NUMBER TO BE SEARCHED"); scanf("%d",&s); c=binary(0,n-1); if(c==-1) printf("NOT FOUND"); getch(); } int binary(int f,int l) {  md=(f+l)/2; if(f>l) { return(-1); } else if (a[md]<s) return(binary(md+1,l)); else if(a[md]==s) {printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md); return (1); } else return(binary(f,md-1)); } LIST OF PROGRAMS
2 comments
Read more