A loop is used for executing a block of statements repeatedly until a given condition returns false. C For loop This is one of the most frequently used loop in C programming. Syntax of for loop: for (initialization; condition test; increment or decrement) { //Statements to be executed repeatedly } Flow Diagram of For loop … Read more
Operator Precedence in C Operator precedence determines which operator is evaluated first when an expression has more than one operators. For example 100-2*30 would yield 40, because it is evaluated as 100 – (2*30) and not (100-2)*30. The reason is that multiplication * has higher precedence than subtraction(-). Associativity in C Associativity is used when … Read more
#include <stdio.h> largest_element(int arr[], int num) { int i, max_element; max_element = arr[0]; for (i = 1; i < num; i++) if (arr[i] > max_element) max_element = arr[i]; return max_element; } int main() { int arr[] = {1, 24, 145, 20, 8, -101, 300}; int n = sizeof(arr)/sizeof(arr[0]); printf(“Largest element of array is %d”, largest_element(arr, … Read more
#include <stdio.h> int main() { int circle_radius; float PI_VALUE=3.14, circle_area, circle_circumf; printf(“\nEnter radius of circle: “); scanf(“%d”,&circle_radius); circle_area = PI_VALUE * circle_radius * circle_radius; printf(“\nArea of circle is: %f”,circle_area); circle_circumf = 2 * PI_VALUE * circle_radius; printf(“\nCircumference of circle is: %f”,circle_circumf); return(0); }
#include<stdio.h> void quicksort(int number[25],int first,int last){ int i, j, pivot, temp; if(first<last){ pivot=first; i=first; j=last; while(i<j){ while(number[i]<=number[pivot]&&i<last) i++; while(number[j]>number[pivot]) j–; if(i<j){ temp=number[i]; number[i]=number[j]; number[j]=temp; } } temp=number[pivot]; number[pivot]=number[j]; number[j]=temp; quicksort(number,first,j-1); quicksort(number,j+1,last); } } int main(){ int i, count, number[25]; printf(“How many elements are u going to enter?: “); scanf(“%d”,&count); printf(“Enter %d elements: “, count); … Read more
#include<stdio.h> int main(){ int count, temp, i, j, number[30]; printf(“How many numbers are u going to enter?: “); scanf(“%d”,&count); printf(“Enter %d numbers: “,count); for(i=0;i<count;i++) scanf(“%d”,&number[i]); for(i=count-2;i>=0;i–){ for(j=0;j<=i;j++){ if(number[j]>number[j+1]){ temp=number[j]; number[j]=number[j+1]; number[j+1]=temp; } } } printf(“Sorted elements: “); for(i=0;i<count;i++) printf(” %d”,number[i]); return 0; }
#include<stdio.h> int main(){ int i, j, count, temp, number[25]; printf(“How many numbers u are going to enter?: “); scanf(“%d”,&count); printf(“Enter %d elements: “, count); for(i=0;i<count;i++) scanf(“%d”,&number[i]); for(i=1;i<count;i++){ temp=number[i]; j=i-1; while((temp<number[j])&&(j>=0)){ number[j+1]=number[j]; j=j-1; } number[j+1]=temp; } printf(“Order of Sorted elements: “); for(i=0;i<count;i++) printf(” %d”,number[i]); return 0; }
#include <stdio.h> void main() { int num; printf(“Enter a number: \n”); scanf(“%d”, &num); if (num > 0) printf(“%d is a positive number \n”, num); else if (num < 0) printf(“%d is a negative number \n”, num); else printf(“0 is neither positive nor negative”); }
#include <stdio.h> int main(){ int num1, num2, quot, rem; printf(“Enter dividend: “); scanf(“%d”, &num1); printf(“Enter divisor: “); scanf(“%d”, &num2); quot = num1 / num2; rem = num1 % num2; printf(“Quotient is: %d\n”, quot); printf(“Remainder is: %d”, rem); return 0; }
#include <stdio.h> int main() { int num, reverse_num=0, remainder,temp; printf(“Enter an integer: “); scanf(“%d”, &num); temp=num; while(temp!=0) { remainder=temp%10; reverse_num=reverse_num*10+remainder; temp/=10; } if(reverse_num==num) printf(“%d is a palindrome number”,num); else printf(“%d is not a palindrome number”,num); return 0; }