Posts

search element in a circular sorted array

int main() { int A[] = {12,14,18,21,3,6,8,9}; int n = 8; int x = 6; int index = binarySearch(A,n,x); if(index == -1){   printf("%d not found in the array",x); } else{   printf("%d is found at index %d",x,index); } return 0; } int binarySearch(int A[],int n, int x){ int low = 0,high = n-1; while(low <= high){ int  mid = (low + high)/2;   if(x == A[mid])       return mid;         if(A[mid]<=A[high]){     if(x>A[mid] && x<=A[high])       low = mid+1;     else       high = mid-1;}   else{     if(x>=A[low] && x <A[mid])       high = mid-1;     else       low = mid+1;}   }     return -1; }    

Finding first or last occurrence of an element in array

#include <stdio.h> int main() { int A[] = {2,2,6,8,10,11}; int x = 2; int n = 6; int result = -1; int index = binarySearch(A,n,x); if(index == -1) {   printf("%d is not found at index %d",x,index); } else {   printf("%d is found at index %d",x,index); }   return 0;  } int binarySearch(int A[],int n,int x){   int start = 0, end = n-1, option,result = -1;   printf("Choose option:1 for first occurrence \nChoose option:2 for last occurrence\n");   printf("Enter any option to find first or last occurrence of an element:");     scanf("%d",&option);   while(start <= end){     int mid = (start + end)/2;         if(option == 1){     if(x == A[mid]){       result = mid;       end = mid-1;     }     else if(x < A[mid]){       end = mid-1;     }     else{       ...

Binary search

int main() { int A[] = {2,4,6,8,10,11}; int x = 4; int n = 6; int index = binarySearch(A,n,x); if(index == -1) {   printf("%d is not found at index %d",x,index); } else {   printf("%d is found at index %d",x,index); }   return 0;  } int binarySearch(int A[],int n,int x){   int start = 0, end = n-1;   while(start <= end){     int mid = (start + end)/2;     if(x == A[mid]){       return mid;     }     else if(x < A[mid]){       end = mid-1;     }     else{       start = mid+1;     }   }   return -1; }

Adding Negative numbers without using plus operator

int main() { int x = -1, y = -4; while(y!=0) {     x--;     y++;     }     printf("%d",x);     return 0; } output: -5

Adding two numbers without using plus(+) operator

int main() { int x = 3 , y = 4; while(y){   x++;   y--; } printf("%d",x);     return 0; } output: 7

Program to know the range of short unsigned integer

/* Program to know the range of short unsigned integer*/ #include <stdio.h> #include <limits.h> int main() { short int var1 = 0; short int var2 = USHRT_MAX; printf("range of short unsigned integer is from %u to %u",var1,var2);   return 0; }

Program to know the range of short signed integer

/* Program to know the range of short signed integer*/ #include <stdio.h> #include <limits.h> int main() { short int var1 = SHRT_MIN; short int var2 = SHRT_MAX; printf("range of short signed integer is from %d to %d",var1,var2);   return 0; }

Program to know the range of unsigned integer

/* Program to know the range of unsigned integer*/ #include <stdio.h> #include <limits.h> int main() { int var1 = 0; int var2 = UINT_MAX; printf("range of unsigned integer is from %u  to %u",var1,var2);   return 0; }

Program to know the range of signed integer

/* Program to know the range of signed integer*/ #include <stdio.h> #include <limits.h> int main() { int var1 = INT_MIN; int var2 = INT_MAX; printf("range of signed integer is from %d to %d",var1,var2);   return 0; }

write a program that takes the first term and the value n and kth term in the series

Image
#include <stdio.h> int main() {     int i,n,k=4;     printf("Enter the value of n");     scanf("%d",&n);     for(i=2;i<=n;i++)     {         if(i%2==0)         {             k=k+5;         }         else             k=k-2;     }     printf("%d",k);     return 0; } OUTPUT: Enter the value of n 5 10

Accept a positive integer and find next prime number to it

Image
#include <stdio.h> int main() {     int i,j,x;     printf("Enter The Value of X");     scanf("%d",&x);     for(i=x+1;i<=x+10;i++)     {         for(j=2;j<=i;j++)         {             if(i%j==0)             {                 break;             }         }         if(i==j)         {             printf("%d",i);             break;         }     }     OUTPUT: Enter The Value of X 8 11

series of numbers when a sequence of prime numbers are added

Image
int main() {   int i,j,k=4; for(i=2;i<=13;i++) {   for(j=2;j<=i;j++)   {     if(i%j==0)     {       break;     }   }     if(i==j)     {        k= k+i;     printf("%d ",k);     } }   return 0; } OUTPUT:

Geometric progression

Image
#include <stdio.h> int main() { long int a,r; printf("Enter a\n"); scanf("%ld",&a); printf("Enter r\n"); scanf("%ld",&r); long int k=1,n; printf("Enter n\n"); scanf("%ld",&n); if(r==3||r==4) {   if(n%2!=0)   {     n = (n/2)+1;     for(long i=1;i<n;i++)     {       k=k*r;     }     k= a*k;     printf("%d",k);   }   else   {     n = n/2;     for(long i=1;i<n;i++)     {       k=k*r;     }     k= a*k;     printf("%d",k);   } } } OUTPUT: Enter a 1 Enter r 3 Enter n 11 243

print an array in zigzag order

Image
int main() { int a[7]={3,4,6,2,1,8,9}; int flag =0,n=3,i=0,k; while(n) {     if(flag==0&&a[i]<a[i+1])     {             flag=1;       i++;     }     else{       k=a[i];       a[i]=a[i+1];       a[i+1]=k;       i++;           }     if(flag==1&&a[i]>a[i+1])     {          flag=0;         i++;     }     else     {       k=a[i];       a[i]=a[i+1];       a[i+1]=k;       i++;           }         n--; } for(i=0;i<7;i++) {   printf("%d\t",a[i]); } } OUTPUT:

Print 2-D array in spiral order

#include <stdio.h> int main() { int arr[3][3]= {                 {1, 2, 3},                 {4, 5, 6},                 {7, 8, 9},             };        spiral(arr);    return 0; } void spiral(int arr[3][3]) {     int top =0,right=2,left=0,bottom=2,dir =1, i;         while(top <= bottom && left <= right)     {         if (dir==1)         {             for( i =0;i<=2;++i)             {                 printf("%d",arr[top][i]);             }               ++top;               dir=2;   ...

HANGMAN GAME IN JAVASCRIPT

<html> <script> alert("Note: This ia a Game where You will guess words by using input as letters you shoud give input based on blankspaces && your guessing is limited to 15"); var words= ["javascript","monkey","amazing","pancake","album", "atlas", "bestseller", "booklet", "brochure", "codex", "compendium", "copy", "dictionary", "dissertation", "edition", "encyclopedia", "essay", "fiction", "folio", "handbook", "hardcover", "leaflet", "lexicon", "magazine", "manual", "monograph","nonfiction", "novel", "octavo", "offprint", "omnibus", "opus", "opuscule", "pamphlet", "paperback", ...

Converting Celsius to Fahrenheit and Fahrenheit to Celsius

#include <stdio.h> int main() { float c,f; int x; //press 1 if u want temperature in celsius //press 2 if u want temperature in fahrenheit printf("Enter your choice 1 || 2 \n"); scanf("%d",&x); switch(x) {   case 1:     printf("Enter the value of temperature in farenheit\n");     scanf("%f",&f);     c=f-32;     printf("The value of temperature in celsius is %1.f",c/9);     break;   case 2:     printf("enter the value of temperature in celsius\n");     scanf("%f",&c);     f= 9*c;     printf("The value of temperature in fahrenheit is %1.f",f+32);     break;   return 0; } }

Fibbonacci series

Image
int main() { int f1 =0,f2=1,f; for(int i=0;i<5;i++) {   f = f1 +f2;   f1=f2;   f2=f;   printf("%d\t",f); }   return 0; }

Selection sort

Image
void selectionSort(int A[],int n) {   for(int i=0;i<=4;i++)   {     int imin=i;     for(int j=i+1;j<=5;j++)     {       if(A[j]<A[imin])       {         imin = j;       }       int temp = A[i];       A[i] = A[imin];       A[imin] = temp  ;     }   } } int main() {   int A[]={2,4,7,1,5,3};   selectionSort(A,6);   for(int i=0;i<=5;i++)   {     printf("%d",A[i]);   }     return 0; }

Printing prime Number between a range 2 to 10

Image
int main() {   int i,j;   for(i=2;i<=10;i++)   {     for(j=2;j<=i;j++)     {       if(i%j==0)       {         break;       }     }     if(i==j)     {       printf("%d\t",j);     }   }   return 0; } OUTPUT: