Geeks for Geeks Sudo placement: Immediate Smaller Element in array in C language

The code below is Geeks for Geeks Sudo placement challenge for checking immediate smaller Element in an array and printing the desired output. Geeks for Geeks challenge(Sudo Placement): Given an integer array, for each element in the array check whether there exists a smaller element on the next immediate position of the array. […]

A program using single subscribed variable to evaluate the expression in C language

The following C program is used to evaluate the following expression: Total = Σ i=110  Xi2 where  X1, X2 … X10 they are user inputs. The code has been tested in Dev c++. CODE: #include<stdio.h> void main(){ int i; float x[10],value,total; printf(“Enter 10 REAL Numbers”); for(i=0;i<10;i++){ scanf(“%f”,&value); x[i]=value; } total=0.0; for(i=0;i<10;i++){ […]

Program to sort the elements of an array in descending order in C language

The program below sort the elements of an array in descending order. It uses malloc function to allocate the space for number of elements that user enters. The code is pretty forward. With sizeof(), the program is taking the size of the n variable that’s taking the value from the user […]

Program to evaluate Graph equation y=x^n using C Language

This is the program to evaluate graph equation y=xn. This code works with non negative integers. The following code has been written and compiled in Dev c++. Code: #include<stdio.h> void main(){ int count,n; float x,y; printf(“enter the value of X and N \n”); scanf(“%f%d”,&x,&n); y=1.0; count=1; while(count<=n){ y=y*x; count++; } […]

Program to find GCD of two numbers in C language

The following program is to find the GCD or HCF of a number using C Language. GCD is the Greatest Common Divisor that divides a particular number. #include<stdio.h> void main(){ int a,b,i,j; printf(“\n****************************\nprogram to find GCD of 2 Numbers\n*****************************\n\n”); printf(“Enter two numbers: “); scanf(“%d%d”,&a,&b); printf(“Common Factors for %d and %d […]