├── 2D Matrix Multiplication ├── ALGO_BUCKETSORT ├── AddTwonumbers ├── Add_to_numb ├── Addfunction ├── Addition ├── Addition Number ├── Arithmatic Operations ├── Armstrong Number ├── Armstrong.c ├── ArmstrongNumber ├── Armstrong_ number ├── Array ├── BFS in Graph ├── BST_Level-Order_Traversal.cpp ├── BestTimeToBuyStocks.cpp ├── Biggest of three number ├── Binary Search ├── Binary_Search ├── Binary_to_decimal_conversion ├── BitsSwap ├── Bubble Sort ├── Bubble Sort using C ├── C Pattern ├── C Program for Rat in a Maze ├── C Program to Add Two Matrices Using Multi-dimensional Arrays ├── C Program to Find the Size of int, float, double and char ├── C Program to convert Decimal to Binary ├── C Program to print Alphabet Triangle ├── C Program to print Number Triangle ├── C program for Prime Number ├── C program to insert an element in an array ├── C program to reverse given string ├── C++ Program to Find All Roots of a Quadratic Equation ├── CODE FOR BANK APPLICATION: ├── CONTRIBUTING.md ├── Calculator ├── Calendar ├── Calendar Application ├── Check Armstrong number of n digits ├── Check Leap Year ├── Check whether the given year of input is a leap year or not. ├── Circle ├── CodeForces_Solution ├── Conversion_program ├── Convert Binary Number to Decimal Number ├── Convert Numbers to Roman Numerals ├── Convert binary to decimal ├── Convert decimal to binary ├── Copy String Without Using strcpy() ├── Count largest elements in Array ├── Covert degree celsius into fahrenheit ├── Creat A Simple Calculator ├── DDA_Algo ├── Days Conversion ├── Decimal to Binary Number Conversion ├── Diamond_pattern ├── Display occurrence of word in given string. ├── Duplicate number ├── EMI_calculator ├── Electric Bill ├── FactFunc ├── Factorial ├── Factorial Program ├── Factorial number ├── Factorial of any number ├── Factorial_of_a_number ├── FahrenheitToCentigrade ├── Fibonacci ├── Fibonacci Sequence ├── Fibonacci Series in C ├── Fibonacci Series in c ├── Fibonacci Series up to n terms ├── Fibonacci series ├── Fibonachi series ├── Find even and odd number ├── Find missing number ├── Find odd or even no ├── First small letter in string ├── Floyd warshall algorthim ├── Funnystring ├── GCD Of numbers ├── GCD of 2 number ├── GREATER NO. ├── Game ├── Gcd of any number using recursion in c ├── Gcdrecursion.cpp ├── Greater Integer ├── Greater number ├── GreaterNumber ├── Greaterbhai ├── Greaterno ├── Greaternumber ├── Greatest No. ├── Half pyramid of * ├── HangmangameinC ├── Heapsort.c ├── Hello world Program ├── Hello, World ├── Identifies_missing_numbers ├── Indian Flag ├── Insertion sort ├── Intersection point of 2 linked list ├── IpAddress.c ├── Knapsack problem ├── LCM ├── LRU_Cache.cpp ├── LargestNo. ├── Leap Year ├── Leap Year Checker ├── Library management system using structures in C ├── Linked List implementation of Queue ├── Linked List traversal ├── Linked_List_in_C ├── Liquidityno ├── MagicSquare.c ├── Matrix.c ├── Matrixmultiplication.c ├── Maxof3 ├── Memory-management-in-c ├── Merge sort ├── Merge two arrays ├── Merge two sorted arrays ├── MergeOverlappingSubIntervals ├── Multiple if statements ├── Multiplication of Two Numbers ├── MultiplicationOfMatrix.c ├── Music Player ├── N reverse natural number ├── NUmber to Words conversation ├── Neon ├── Octal to Hexadecimal in C ├── Odd and even ├── OddEven ├── Oil Spill Game. C ├── Palindrome ├── Palindrome Number ├── Palindrome no. ├── Pascal's Triangle ├── PascalTriangle.cpp ├── Pattern Program in c ├── Perfect Number ├── Positive Negative Zero ├── Positive or Negative ├── Prime Number in C ├── Prime number ├── PrimeNumber ├── Print Upper case Lower case alphabet ├── Print numbers ├── Product ├── Product of two No. ├── Program of Fibonacci Series ├── Program of adding two number in c ├── Program to Add Two Matrices ├── Program to Check Prime Number ├── Program to Reverse a String Using Recursion ├── Program to convert binary to decimal.c ├── Program to multiply two matrices ├── QuadraticRoots.c ├── Quick Sort ├── README.md ├── RECURSION ├── Radix-Sort ├── ReadWrite.cpp ├── Readability_cs50 ├── RegEx_Patterns_and_Intro_to_Databases.cpp ├── Remove common alphabets from 2nd string ├── Remove repeated words in string. ├── ReverseNumber.c ├── Reverseno. ├── Roots of a Quadratic Equation ├── SMALLNO ├── Second Largest Element in Array ├── Selection Sort Program in C ├── Selection sort ├── Simple Interest ├── Simple calculator ├── SimpleCalci ├── Smaller Number ├── Smaller number ├── Smallest ├── Smallest number in an array ├── Smart Calculator ├── Snake ├── Snake Game in C ├── Snake and Ladder Game ├── Sort in Descending order ├── Sorting Arrays ├── SquareFill with stars ├── Squareroot ├── Star Pattern ├── Star_pattern_heart ├── Stock_Span ├── String reverse ├── Structures as Function Arguments ├── Sum ├── Sum of Two numbers ├── Sum of two number ├── SumOfTwoNumber ├── Swap 2 numbers ├── Swapnumbers ├── Swapping Two Numbers ├── Swapping of two number ├── Swapping two Numbers ├── Table ├── Tac Toe game ├── Tetris ├── Tic tac toe ├── To Print a Rombus star pattern ├── Tower of Hanoi ├── TowerOfHanoi ├── Triplet of three numbers (a,b,c) ├── Window Sliding Technique ├── Winshree ├── add multiply divide and substract ├── add two numbers in c ├── addition ├── addition and subtraction ├── addition no ├── addition of two number ├── additionoftwonumber ├── addnos ├── addoftwono ├── addtwodistance.c ├── advanced calculator CLI ├── affinecypher ├── algorithm for finding height of a binary tree ├── anke game in c language ├── armstrong ├── armstrong number ├── armstrongC ├── armstrongnum ├── assemblyprog ├── basicgameinc ├── biggernumber ├── biggestno ├── bignumber ├── binStack.c ├── bubble sort in C ├── bubble sorting ├── bubble_sort ├── c program of array ├── c program to find duplicate character in a given string ├── c program to find factorial of a number using recursive function ├── calculate power Optimized ├── calculate the salary ├── calculator ├── celcius to farenheit ├── celsius to fahrenheit ├── check leap year ├── check to prime no or not ├── check whether a no. is prime or not ├── checkPalindrome ├── check_prime_number ├── checkpalindrome ├── cieser-cipher-encryption ├── classes ├── coding template ├── compond_interest ├── concatenate str ├── count_totalno_of_alphabet_digit_and_special_char ├── countingsort ├── countvowels ├── cprogram ├── creatervikas ├── cubeno ├── datatypes ├── decimaltobinary ├── digital-clock ├── duplicateelementsinarray ├── even or odd number ├── evenodd ├── evnodd ├── example to calculate income tax ├── fabonaccisequence ├── factorailno ├── factorial ├── factorial by recursion ├── factorial number ├── factorial.c ├── factorial_prog ├── factors ├── febonacci series ├── fibanocci_series ├── fibonacci ├── fibonacci no. ├── fibonacci series ├── fibonaci of certain number ├── find gcd ├── find prime numbers in a given range ├── finding the largest element in an array ├── findingtickets ├── flying_character ├── gassbooking ├── gcd_of_2_numbers ├── graphicscarmove ├── graterNumber ├── greatearno ├── greatemo ├── greater number ├── greater number c ├── greater of three numbers ├── greater of two number ├── greater_two_number ├── greaterno ├── greaterno. ├── greaterno10 ├── greaternoofthree ├── greaternumber ├── greaternumberofAorB ├── greatertwonumber ├── greatest number ├── greatest number 1 ├── greatestoftwonumbers ├── greatmo ├── greatno ├── greatorno ├── greternumber ├── gretest ├── gretter new ├── hacktoberfest ├── hangman game ├── happyNumber.c ├── hash_on_eightbitnumber.c ├── heapsort ├── helloc ├── hexadecimaltodecimal ├── hollow diamond ├── infix to postfix ├── int, float, double and char ├── interest.c ├── intrest ├── ipcheck_in_linux ├── larger ├── leapYear ├── leapyear.c ├── linked_list_deletion.c ├── m%n remainder 1.c ├── mapOfIndia ├── maxinarray ├── merge and quick sort ├── mergetwosortedarrays ├── multiple of 3 ├── multiplication ├── multiplication of 2 matrix ├── multiplication of 2.12 and 3.88 ├── multiplication_table ├── multiply ├── multiply two no. ├── multiplyoftwono ├── negativeNumber.c ├── next →← prev Matrix multiplication in C ├── no of digits in number ├── numberSwap ├── odd number ├── odd or enen ├── optimized implementation of bubble sort ├── orphanprocess.c ├── p for calculator ├── palindrom ├── palindrome ├── palindrome using while loop ├── palindromecheck ├── pascaltriangle ├── passing address ├── pattern programs ├── pattern1.c ├── pelindromeno ├── polynomial_equation_solver ├── positiveInteger ├── prime ├── prime no between to intervals ├── prime number ├── prime_or_not ├── primefactors ├── primeno ├── primenumber ├── primenumber1 ├── print an integer ├── print n natural numbers ├── print rainbow ├── printing pattern ├── product ├── prog.c ├── program to check leap year ├── program to check vowel using switch case ├── program to find out the greatest number among four numbers and also it should show whether there are two or three equal numbers ├── program to find the greatest of two numbers in C ├── program to print integer ├── pryamid using * ├── pyramid of * ├── qcircle.c ├── qlinear.c ├── quadilateral formula ├── queue ├── quickSort ├── quick_sort ├── quicksort_c ├── reverse number ├── reverse_a_string ├── reverse_digits ├── reversestr ├── reversing of string ├── sachdevakh ├── seedIT ├── selectionsort ├── sentence to a file ├── shutdown_using_c ├── simple game ├── simple interest finder.c ├── sine_series ├── sleep_sort ├── smallarge ├── sorting of arrays ├── square of a number ├── squarepogram ├── stack pop up program ├── stack,c ├── stack.c ├── stack_implementation.c ├── standard deviation ├── strassen's matrix multiplication ├── string task ├── substrect of two integers ├── subtract ├── sum of two integer ├── sum of two no. ├── sumno ├── swap two numbers without third variable ├── swapping of two numbers ├── swaptwonumber ├── the hollow square star pattern ├── threegreternumber ├── to find armstrong numbers using recursion ├── to find fibonacci series ├── to find prime number ├── tower of hanoi ├── treetransversal.c ├── triangular patterns ├── ugly numbers ├── use of bitwise operators ├── while loop └── zombieprocess.c /ALGO_BUCKETSORT: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | //Bucket Sort Program when integers are floating point numbers in some range 7 | 8 | void bucketSort(float *arr,int n) 9 | { 10 | vector b[n]; 11 | int i,j; 12 | for(i=0;i>n; 38 | int i; 39 | for(i=0;i>arr[i]; 41 | 42 | bucketSort(arr,n); 43 | cout<<"Sorted Array"< 2 | int main() 3 | { 4 | int x, y, z; 5 | 6 | printf("Enter two numbers to add\n"); 7 | scanf("%d%d", &x, &y); 8 | 9 | z = x + y; 10 | 11 | printf("Sum of the numbers = %d\n", z); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Add_to_numb: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Addfunction: -------------------------------------------------------------------------------- 1 | void add(int,int); 2 | #include 3 | int main(){ 4 | int num1,num2; 5 | printf("Enter two integers\n"); 6 | scanf("%d %d",&num1,&num2); 7 | add(num1,num2); 8 | return 0; 9 | } 10 | void add(int x,int y){ 11 | int sum=x+y; 12 | printf("Sum of two numbers is %d",sum); 13 | } 14 | -------------------------------------------------------------------------------- /Addition: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum efficiently 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Addition Number: -------------------------------------------------------------------------------- 1 | Addition program in C 2 | 3 | #include 4 | int main() 5 | { 6 | int x, y, z; 7 | 8 | printf("Enter two numbers to add\n"); 9 | scanf("%d%d", &x, &y); 10 | 11 | z = x + y; 12 | 13 | printf("Sum of the numbers = %d\n", z); 14 | 15 | return 0; 16 | } 17 | 18 | -------------------------------------------------------------------------------- /Arithmatic Operations: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int a,b; 7 | scanf("%d%d",&a,&b); 8 | printf("%d\n%d\n%d\n%d\n%d",(a+b),(a-b),(a*b),(a%b),(a/b)); 9 | } 10 | -------------------------------------------------------------------------------- /Armstrong Number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num, originalNum, remainder, result = 0; 4 | printf("Enter a three-digit integer: "); 5 | scanf("%d", &num); 6 | originalNum = num; 7 | 8 | while (originalNum != 0) { 9 | // remainder contains the last digit 10 | remainder = originalNum % 10; 11 | 12 | result += remainder * remainder * remainder; 13 | 14 | // removing last digit from the orignal number 15 | originalNum /= 10; 16 | } 17 | 18 | if (result == num) 19 | printf("%d is an Armstrong number.", num); 20 | else 21 | printf("%d is not an Armstrong number.", num); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Armstrong.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num, originalNum, remainder, result = 0; 4 | printf("Enter a three-digit integer: "); 5 | scanf("%d", &num); 6 | originalNum = num; 7 | 8 | while (originalNum != 0) { 9 | // remainder contains the last digit 10 | remainder = originalNum % 10; 11 | 12 | result += remainder * remainder * remainder; 13 | 14 | // removing last digit from the orignal number 15 | originalNum /= 10; 16 | } 17 | 18 | if (result == num) 19 | printf("%d is an Armstrong number.", num); 20 | else 21 | printf("%d is not an Armstrong number.", num); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /ArmstrongNumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,r,sum=0,temp; 5 | printf("enter the number="); 6 | scanf("%d",&n); 7 | temp=n; 8 | while(n>0) 9 | { 10 | r=n%10; 11 | sum=sum+(r*r*r); 12 | n=n/10; 13 | } 14 | if(temp==sum) 15 | printf("armstrong number "); 16 | else 17 | printf("not armstrong number"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Armstrong_ number: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int n,t,rev=0; 6 | clrscr(); 7 | printf("Enter the any value to check armstrong no : "); 8 | scanf("%d",&n); 9 | t=n; 10 | while(n>0) 11 | { 12 | rev+rev+(n%10)*(n%10)*(n%10); 13 | n=n/10; 14 | } 15 | if(rev=t) 16 | { 17 | printf("\nThe no. is armstrong"); 18 | } 19 | else 20 | { 21 | printf("\nThe no. is not armstrong"); 22 | } 23 | getch(); 24 | } 25 | -------------------------------------------------------------------------------- /Array: -------------------------------------------------------------------------------- 1 | / Program to take 5 values from the user and store them in an array 2 | // Print the elements stored in the array 3 | #include 4 | 5 | int main() { 6 | int values[5]; 7 | 8 | printf("Enter 5 integers:\n"); 9 | 10 | // taking input and storing it in an array 11 | for(int i = 0; i < 5; ++i) { 12 | scanf("%d", &values[i]); 13 | 14 | } 15 | 16 | printf("Displaying integers:\n"); 17 | 18 | // printing elements of an array 19 | for(int i = 0; i < 5; ++i) { 20 | printf("%d\n", values[i]); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /BestTimeToBuyStocks.cpp: -------------------------------------------------------------------------------- 1 | /* Say you have an array for which the ith element is the price of a given stock on day i. 2 | 3 | If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit. 4 | 5 | Note that you cannot sell a stock before you buy one. */ 6 | 7 | 8 | class Solution { 9 | public: 10 | int maxProfit(vector& v) { 11 | int profit=0; 12 | int mini=INT_MAX; 13 | for(int i=0;i 2 | 3 | void main() 4 | { 5 | int num1, num2, num3; 6 | 7 | printf("Enter the values of num1, num2 and num3\n"); 8 | scanf("%d %d %d", &num1, &num2, &num3); 9 | printf("num1 = %d\tnum2 = %d\tnum3 = %d\n", num1, num2, num3); 10 | if (num1 > num2) 11 | { 12 | if (num1 > num3) 13 | { 14 | printf("num1 is the greatest among three \n"); 15 | } 16 | else 17 | { 18 | printf("num3 is the greatest among three \n"); 19 | } 20 | } 21 | else if (num2 > num3) 22 | printf("num2 is the greatest among three \n"); 23 | else 24 | printf("num3 is the greatest among three \n"); 25 | } 26 | -------------------------------------------------------------------------------- /Binary Search: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | #include 5 | 6 | 7 | int binarySearch(int arr[], int l, int r, int x) 8 | { 9 | if (r >= l) { 10 | int mid = l + (r - l) / 2; 11 | 12 | 13 | if (arr[mid] == x) 14 | return mid; 15 | 16 | 17 | if (arr[mid] > x) 18 | return binarySearch(arr, l, mid - 1, x); 19 | 20 | 21 | return binarySearch(arr, mid + 1, r, x); 22 | } 23 | 24 | 25 | return -1; 26 | } 27 | 28 | int main(void) 29 | { 30 | int arr[] = { 2, 3, 4, 10, 40 }; 31 | int n = sizeof(arr) / sizeof(arr[0]); 32 | int x = 10; 33 | int result = binarySearch(arr, 0, n - 1, x); 34 | (result == -1) ? printf("Element is not present in array") 35 | : printf("Element is present at index %d", 36 | result); 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /Binary_to_decimal_conversion: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int decimalnum = 0, temp = 0, remainder; 7 | long binarynum; 8 | printf("Enter a binary number: "); 9 | scanf("%ld", &binarynum); 10 | while (binarynum!=0) 11 | { 12 | remainder = binarynum % 10; 13 | binarynum = binarynum / 10; 14 | decimalnum = decimalnum + remainder*pow(2,temp); 15 | temp++; 16 | } 17 | 18 | printf("Equivalent decimal number is: %d", decimalnum); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /BitsSwap: -------------------------------------------------------------------------------- 1 | 2 | 3 | #include 4 | 5 | int swapBits(unsigned int x, unsigned int p1, unsigned int p2, unsigned int n) 6 | { 7 | 8 | unsigned int set1 = (x >> p1) & ((1U << n) - 1); 9 | 10 | unsigned int set2 = (x >> p2) & ((1U << n) - 1); 11 | 12 | 13 | unsigned int xor = (set1 ^ set2); 14 | 15 | xor = (xor << p1) | (xor << p2); 16 | 17 | 18 | unsigned int result = x ^ xor; 19 | 20 | return result; 21 | } 22 | 23 | 24 | int main() 25 | { 26 | int res = swapBits(28, 0, 3, 2); 27 | printf("\nResult = %d ", res); 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /Bubble Sort: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void swap(int *xp, int *yp) 5 | { 6 | int temp = *xp; 7 | *xp = *yp; 8 | *yp = temp; 9 | } 10 | 11 | // A function to implement bubble sort 12 | void bubbleSort(int arr[], int n) 13 | { 14 | int i, j; 15 | for (i = 0; i < n-1; i++) 16 | 17 | // Last i elements are already in place 18 | for (j = 0; j < n-i-1; j++) 19 | if (arr[j] > arr[j+1]) 20 | swap(&arr[j], &arr[j+1]); 21 | } 22 | 23 | /* Function to print an array */ 24 | void printArray(int arr[], int size) 25 | { 26 | int i; 27 | for (i = 0; i < size; i++) 28 | cout << arr[i] << " "; 29 | cout << endl; 30 | } 31 | 32 | // Driver code 33 | int main() 34 | { 35 | int arr[] = {64, 34, 25, 12, 22, 11, 90}; 36 | int n = sizeof(arr)/sizeof(arr[0]); 37 | bubbleSort(arr, n); 38 | cout<<"Sorted array: \n"; 39 | printArray(arr, n); 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /Bubble Sort using C: -------------------------------------------------------------------------------- 1 | #include 2 | void main () 3 | { 4 | int i, j,temp; 5 | int a[10] = { 10, 9, 7, 101, 23, 44, 12, 78, 34, 23}; 6 | for(i = 0; i<10; i++) 7 | { 8 | for(j = i+1; j<10; j++) 9 | { 10 | if(a[j] > a[i]) 11 | { 12 | temp = a[i]; 13 | a[i] = a[j]; 14 | a[j] = temp; 15 | } 16 | } 17 | } 18 | printf("Printing Sorted Element List ...\n"); 19 | for(i = 0; i<10; i++) 20 | { 21 | printf("%d\n",a[i]); 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /C Pattern: -------------------------------------------------------------------------------- 1 | include 2 | 3 | int main() 4 | { int i,j,n; 5 | printf("enter n= "); 6 | scanf("%d",&n); 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | {if(i==j) 11 | printf("\\"); 12 | else if(i+j==n+1) 13 | printf("/"); 14 | else printf("*"); 15 | } 16 | printf("\n"); 17 | 18 | }} 19 | -------------------------------------------------------------------------------- /C Program to Find the Size of int, float, double and char: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int intType; 4 | float floatType; 5 | double doubleType; 6 | char charType; 7 | 8 | // sizeof evaluates the size of a variable 9 | printf("Size of int: %ld bytes\n", sizeof(intType)); 10 | printf("Size of float: %ld bytes\n", sizeof(floatType)); 11 | printf("Size of double: %ld bytes\n", sizeof(doubleType)); 12 | printf("Size of char: %ld byte\n", sizeof(charType)); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /C Program to convert Decimal to Binary: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | int a[10],n,i; 5 | system ("cls"); 6 | printf("Enter the number to convert: "); 7 | scanf("%d",&n); 8 | for(i=0;n>0;i++) 9 | { 10 | a[i]=n%2; 11 | n=n/2; 12 | } 13 | printf("\nBinary of Given Number is="); 14 | for(i=i-1;i>=0;i--) 15 | { 16 | printf("%d",a[i]); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /C Program to print Alphabet Triangle: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | int ch=65; 5 | int i,j,k,m; 6 | system("cls"); 7 | for(i=1;i<=5;i++) 8 | { 9 | for(j=5;j>=i;j--) 10 | printf(" "); 11 | for(k=1;k<=i;k++) 12 | printf("%c",ch++); 13 | ch--; 14 | for(m=1;m 2 | #include 3 | int main(){ 4 | int i,j,k,l,n; 5 | system("cls"); 6 | printf("enter the range="); 7 | scanf("%d",&n); 8 | for(i=1;i<=n;i++) 9 | { 10 | for(j=1;j<=n-i;j++) 11 | { 12 | printf(" "); 13 | } 14 | for(k=1;k<=i;k++) 15 | { 16 | printf("%d",k); 17 | } 18 | for(l=i-1;l>=1;l--) 19 | { 20 | printf("%d",l); 21 | } 22 | printf("\n"); 23 | } 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /C program for Prime Number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /C program to insert an element in an array: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int array[100], position, c, n, value; 6 | printf("Enter number of elements in array\n"); 7 | scanf("%d", &n); 8 | 9 | printf("Enter %d elements\n", n); 10 | 11 | for (c = 0; c < n; c++) 12 | scanf("%d", &array[c]); 13 | 14 | printf("Enter the location where you wish to insert an element\n"); 15 | scanf("%d", &position); 16 | 17 | printf("Enter the value to insert\n"); 18 | scanf("%d", &value); 19 | 20 | for (c = n - 1; c >= position - 1; c--) 21 | array[c+1] = array[c]; 22 | 23 | array[position-1] = value; 24 | 25 | printf("Resultant array is\n"); 26 | 27 | for (c = 0; c <= n; c++) 28 | printf("%d\n", array[c]); 29 | 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /C program to reverse given string: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | #include 5 | 6 | int main() 7 | 8 | { 9 | 10 | char name[30] = "Hello"; 11 | 12 | printf("String before strrev( ) : %s\n",name); 13 | 14 | printf("String after strrev( ) : %s",strrev(name)); 15 | 16 | return 0; 17 | 18 | } 19 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | int main(){ 5 | int arr[100]; 6 | int size , n; 7 | printf("\n Enter the size of array \n"); 8 | scanf("%d",&size); 9 | printf("\n Enter the elements of array \n"); 10 | for (int i = 0; i < size; i++) 11 | { 12 | scanf("%d",&arr[i]); 13 | } 14 | 15 | for (int i = 0; i < size; i++) 16 | { 17 | for(int j=i+1; jarr[j]) 19 | { 20 | n = arr[i]; 21 | arr[i] = arr[j]; 22 | arr[j] = n; 23 | } 24 | 25 | } 26 | } 27 | printf("\n The numbers arranged in ascending order is \n"); 28 | for (int i = 0; i < size; i++) 29 | { 30 | printf("%d\n",arr[i]); 31 | } 32 | 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Calculator: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | 5 | char operator; 6 | 7 | double first, second; 8 | 9 | printf("Enter an operator (+, -, *,): "); 10 | 11 | scanf("%c", &operator); 12 | 13 | printf("Enter two operands: "); 14 | 15 | scanf("%lf %lf", &first, &second); 16 | 17 | switch (operator) { 18 | 19 | case '+': 20 | 21 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 22 | 23 | break; 24 | 25 | case '-': 26 | 27 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 28 | 29 | break; 30 | 31 | case '*': 32 | 33 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 34 | 35 | break; 36 | 37 | case '/': 38 | 39 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 40 | 41 | break; 42 | 43 | // operator doesn't match any case constant 44 | 45 | default: 46 | 47 | printf("Error! operator is not correct"); 48 | 49 | } 50 | 51 | return 0; 52 | 53 | } 54 | -------------------------------------------------------------------------------- /Check Armstrong number of n digits: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Check Armstrong Number of n digits 6 | #include 7 | #include 8 | 9 | int main() { 10 | int num, originalNum, remainder, n = 0; 11 | float result = 0.0; 12 | 13 | printf("Enter an integer: "); 14 | scanf("%d", &num); 15 | 16 | originalNum = num; 17 | 18 | // store the number of digits of num in n 19 | for (originalNum = num; originalNum != 0; ++n) { 20 | originalNum /= 10; 21 | } 22 | 23 | for (originalNum = num; originalNum != 0; originalNum /= 10) { 24 | remainder = originalNum % 10; 25 | 26 | // store the sum of the power of individual digits in result 27 | result += pow(remainder, n); 28 | } 29 | 30 | // if num is equal to result, the number is an Armstrong number 31 | if ((int)result == num) 32 | printf("%d is an Armstrong number.", num); 33 | else 34 | printf("%d is not an Armstrong number.", num); 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /Check Leap Year: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | if (year % 400 == 0) { 7 | printf("%d is a leap year.", year); 8 | } 9 | else if (year % 100 == 0) { 10 | printf("%d is not a leap year.", year); 11 | } 12 | else if (year % 4 == 0) { 13 | printf("%d is a leap year.", year); 14 | } 15 | else { 16 | printf("%d is not a leap year.", year); 17 | } 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Check whether the given year of input is a leap year or not.: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int year; 6 | printf("Enter a year to check if it is a leap year\n"); 7 | scanf("%d", &year); 8 | 9 | if ( year%400 == 0) 10 | printf("%d is a leap year.\n", year); 11 | 12 | else if ( year%100 == 0) 13 | printf("%d is not a leap year.\n", year); 14 | 15 | else if ( year%4 == 0 ) 16 | printf("%d is a leap year.\n", year); 17 | 18 | else 19 | printf("%d is not a leap year.\n", year); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Circle: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | int main() 6 | { 7 | int gd=DETECT,gm; 8 | initgraph(&gd, &gm, "c:\\turboc3\\bgi"); 9 | circle(200,200,50); 10 | getch(); 11 | closegraph(); 12 | return 0; 13 | } 14 | 15 | -------------------------------------------------------------------------------- /CodeForces_Solution: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define int long long 4 | #define fio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) 5 | #define endl '\n' 6 | #define mod 1000000007 7 | int min(int a, int b) { 8 | if (a < b) 9 | return a; 10 | else 11 | return b; 12 | } 13 | bool compare(int a, int b) { 14 | return a > b; 15 | } 16 | int32_t main() { 17 | fio; 18 | int t; 19 | cin >> t; 20 | while (t--) { 21 | int n; 22 | cin >> n; 23 | vectorv; 24 | v.push_back(0); 25 | for (int i = 3; i <= n; i += 2) { 26 | v.push_back(2 * i + (i - 2) * 2); 27 | } 28 | int cnt = 0; 29 | for (int i = 0; i < v.size(); i++) { 30 | cnt += v[i] * i; 31 | } 32 | cout << cnt << endl; 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /Convert Binary Number to Decimal Number: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int binaryToDecimal(long binarynum) 4 | { 5 | int decimalnum = 0, temp = 0, remainder; 6 | while (binarynum!=0) 7 | { 8 | remainder = binarynum % 10; 9 | binarynum = binarynum / 10; 10 | decimalnum = decimalnum + remainder*pow(2,temp); 11 | temp++; 12 | } 13 | return decimalnum; 14 | } 15 | 16 | int main() 17 | { 18 | long binarynum; 19 | printf("Enter a binary number: "); 20 | scanf("%ld", &binarynum); 21 | 22 | printf("Equivalent decimal number is: %d", binaryToDecimal(binarynum)); 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Convert binary to decimal: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int convert(long long n); 4 | int main() { 5 | long long n; 6 | printf("Enter a binary number: "); 7 | scanf("%lld", &n); 8 | printf("%lld in binary = %d in decimal", n, convert(n)); 9 | return 0; 10 | } 11 | 12 | int convert(long long n) { 13 | int dec = 0, i = 0, rem; 14 | while (n != 0) { 15 | rem = n % 10; 16 | n /= 10; 17 | dec += rem * pow(2, i); 18 | ++i; 19 | } 20 | return dec; 21 | } 22 | -------------------------------------------------------------------------------- /Convert decimal to binary: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | // function to convert decimal to binary 5 | void decToBinary(int n) 6 | { 7 | // array to store binary number 8 | int binaryNum[32]; 9 | 10 | // counter for binary array 11 | int i = 0; 12 | while (n > 0) { 13 | 14 | // storing remainder in binary array 15 | binaryNum[i] = n % 2; 16 | n = n / 2; 17 | i++; 18 | } 19 | 20 | // printing binary array in reverse order 21 | for (int j = i - 1; j >= 0; j--) 22 | cout << binaryNum[j]; 23 | } 24 | 25 | // Driver program to test above function 26 | int main() 27 | { 28 | int n = 17; 29 | decToBinary(n); 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /Copy String Without Using strcpy(): -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char s1[100], s2[100], i; 4 | printf("Enter string s1: "); 5 | fgets(s1, sizeof(s1), stdin); 6 | 7 | for (i = 0; s1[i] != '\0'; ++i) { 8 | s2[i] = s1[i]; 9 | } 10 | 11 | s2[i] = '\0'; 12 | printf("String s2: %s", s2); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Count largest elements in Array: -------------------------------------------------------------------------------- 1 | #include 2 | /* Given by Mayank Pathak */ 3 | int main() 4 | { 5 | int n,i,large=0,count=0; 6 | scanf("%d",&n); 7 | int a[n]; 8 | for(i=0;ilarge) 18 | { 19 | large=a[i]; 20 | } 21 | } 22 | 23 | //Counting the large element 24 | for(i=0;i 3 | 4 | int main() 5 | { 6 | float celsius, fahrenheit; 7 | 8 | printf("Enter temperature in Celsius: "); 9 | scanf("%f", &celsius); 10 | fahrenheit = (celsius * 9 / 5) + 32; 11 | 12 | printf("%.2f Celsius = %.2f Fahrenheit", celsius, fahrenheit); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Creat A Simple Calculator: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | 31 | 32 | OUTPUT 33 | 34 | Enter an operator (+, -, *,): * 35 | Enter two operands: 1.5 36 | 4.5 37 | 1.5 * 4.5 = 6.8 38 | -------------------------------------------------------------------------------- /DDA_Algo: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int gd = DETECT, gm, i; 8 | int dx, dy, steps, x, y; 9 | float xinc, yinc; 10 | int x0, x1, y0, y1; 11 | initgraph(&gd, &gm, ""); 12 | x0 =10, y0=20, x1=100, y1=110; 13 | dx = x1-x0; 14 | dy = y1-y0; 15 | if(abs(dx)>=abs(dy)){ 16 | steps = abs(dx); 17 | } 18 | else{ 19 | steps = abs(dy); 20 | } 21 | xinc = dx/steps; 22 | yinc = dy/steps; 23 | x=x0; 24 | y=y0; 25 | putpixel(x0, y0, 3); 26 | for (i=0; i 2 | 3 | int main() 4 | { 5 | int days, years, weeks; 6 | 7 | printf("Enter days: "); 8 | scanf("%d", &days); 9 | 10 | years = (days / 365); // Ignoring leap year 11 | weeks = (days % 365) / 7; 12 | days = days - ((years * 365) + (weeks * 7)); 13 | 14 | printf("YEARS: %d\n", years); 15 | printf("WEEKS: %d\n", weeks); 16 | printf("DAYS: %d", days); 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Decimal to Binary Number Conversion: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() { 7 | long n; 8 | scanf("%ld",&n); 9 | int a[64],i=0; 10 | if(n==0)printf("0"); 11 | else{ 12 | while(n>0){ 13 | a[i]=n%2; 14 | n/=2; 15 | i++; 16 | } 17 | for(int j=i-1;j>=0;j--)printf("%d",a[j]); 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Diamond_pattern: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | // your code goes here 6 | int n,i,j,k; 7 | cin>>n; 8 | for( i=1;i<=n;i++){ 9 | for( j=1;j<=n-i;j++) 10 | cout<<" "; 11 | 12 | for( k=1;k<=i*2-1;k++) 13 | cout<<"*"; 14 | 15 | cout<=1;i--){ 18 | for( j=1;j<=n-i;j++) 19 | cout<<" "; 20 | 21 | for( k=1;k<=i*2-1;k++) 22 | cout<<"*"; 23 | 24 | cout< 2 | #include 3 | main() 4 | { 5 | int i,len,sublen,count=0; 6 | char str[100],substr[20],tempstr[20]; 7 | printf("Enter String\n"); 8 | gets(str); 9 | printf("Enter substring to find Occurances\n"); 10 | gets(substr); 11 | len=strlen(str); 12 | sublen=strlen(substr); 13 | if(len>=sublen) 14 | { 15 | for(i=0;i 2 | 3 | int main() 4 | { 5 | //Initialize array 6 | int arr[] = {1, 2, 3, 4, 2, 7, 8, 8, 3}; 7 | 8 | //Calculate length of array arr 9 | int length = sizeof(arr)/sizeof(arr[0]); 10 | 11 | printf("Duplicate elements in given array: \n"); 12 | //Searches for duplicate element 13 | for(int i = 0; i < length; i++) { 14 | for(int j = i + 1; j < length; j++) { 15 | if(arr[i] == arr[j]) 16 | printf("%d\n", arr[j]); 17 | } 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /EMI_calculator: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | float principal, rate, time, emi; 7 | 8 | printf("Enter principal: "); 9 | scanf("%f",&principal); 10 | 11 | printf("Enter rate: "); 12 | scanf("%f",&rate); 13 | 14 | printf("Enter time in year: "); 15 | scanf("%f",&time); 16 | 17 | rate=rate/(12*100); /*one month interest*/ 18 | time=time*12; /*one month period*/ 19 | 20 | 21 | emi= (principal*rate*pow(1+rate,time))/(pow(1+rate,time)-1); 22 | 23 | printf("Monthly EMI is= %f\n",emi); 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /FactFunc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int isneg (int n); 4 | int fact (int n); 5 | int 6 | main () 7 | { 8 | int n; 9 | printf ("Enter no.\n"); 10 | scanf ("%d", &n); 11 | if (isneg (n)) 12 | { 13 | printf ("Fact not possible\n"); 14 | 15 | } 16 | else 17 | { 18 | printf ("The fact of no.is:%d", fact (n)); 19 | } 20 | } 21 | 22 | int 23 | isneg (int n) 24 | { 25 | if (n > 0) 26 | return 0; 27 | else 28 | return 1; 29 | } 30 | 31 | int 32 | fact (int n) 33 | { 34 | int i, s; 35 | for (i = 0; i < n; i++) 36 | { 37 | s = n * i; 38 | } 39 | return s; 40 | } 41 | 42 | -------------------------------------------------------------------------------- /Factorial: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,fact=1,number; 5 | printf("Enter a number: "); 6 | scanf("%d",&number); 7 | for(i=1;i<=number;i++){ 8 | fact=fact*i; 9 | } 10 | printf("Factorial of %d is: %d",number,fact); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /Factorial Program: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,fact=1,number; 5 | printf("Enter a number: "); 6 | scanf("%d",&number); 7 | for(i=1;i<=number;i++){ 8 | fact=fact*i; 9 | } 10 | printf("Factorial of %d is: %d",number,fact); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /Factorial number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int c,n,f=1; 6 | 7 | printf("Enter a number to calculate its factorial\n"); 8 | scanf("%d", &n); 9 | for (c=1; c<=n; c++) 10 | f=f*c; 11 | 12 | printf("Factorial of %d = %d\n", n, f); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Factorial of any number: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int n,i,fact=1; 5 | printf("enter the number whose factorial is required:"); 6 | scanf("%d",&n); 7 | if(n==0) 8 | { 9 | printf("\nFactorial of negative number doesn't exist"); 10 | } 11 | else 12 | { 13 | for(i=1;i<=n;i++) 14 | { 15 | fact=fact*i; 16 | } 17 | } 18 | printf("\nFactorial of %d is :%d",n,fact); 19 | getch(); 20 | } 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | -------------------------------------------------------------------------------- /Factorial_of_a_number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i; 4 | unsigned long long fact = 1; 5 | printf("Enter an integer: "); 6 | scanf("%d", &n); 7 | 8 | // shows error if the user enters a negative integer 9 | if (n < 0) 10 | printf("Error! Factorial of a negative number doesn't exist."); 11 | else { 12 | for (i = 1; i <= n; ++i) { 13 | fact *= i; 14 | } 15 | printf("Factorial of %d = %llu", n, fact); 16 | } 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /FahrenheitToCentigrade: -------------------------------------------------------------------------------- 1 | /*Temperature of a city in Fahrenheit degrees is input through the keyboard. Write a program to convert this temperature into Centigrade degrees.*/ 2 | #include 3 | int main() 4 | { 5 | int c,f; 6 | printf("Enter the value in Fahrenheit "); 7 | scanf("%d",&f); 8 | c=(f-32)*.5556; ;/*(50°F - 32) x .5556 = 10°C*/ 9 | printf("%d",c); 10 | } 11 | -------------------------------------------------------------------------------- /Fibonacci: -------------------------------------------------------------------------------- 1 | #include 2 | int fib(int n) 3 | { 4 | if (n <= 1) 5 | return n; 6 | return fib(n-1) + fib(n-2); 7 | } 8 | 9 | int main () 10 | { 11 | int n = 9; 12 | printf("%d", fib(n)); 13 | getchar(); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Fibonacci Sequence: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Fibonacci Series in C: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n1=0,n2=1,n3,i,number; 5 | printf("Enter the number of elements:"); 6 | scanf("%d",&number); 7 | printf("\n%d %d",n1,n2);//printing 0 and 1 8 | for(i=2;i 2 | int main() 3 | { 4 | int n1=0,n2=1,n3,i,number; 5 | printf("Enter the number of elements:"); 6 | scanf("%d",&number); 7 | printf("\n%d %d",n1,n2);//printing 0 and 1 8 | for(i=2;i 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Fibonacci series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Fibonachi series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int count, first_term = 0, second_term = 1, next_term, i; 5 | 6 | //Ask user to input number of terms 7 | printf("Enter the number of terms:\n"); 8 | scanf("%d",&count); 9 | 10 | printf("First %d terms of Fibonacci series:\n",count); 11 | for ( i = 0 ; i < count ; i++ ) 12 | { 13 | if ( i <= 1 ) 14 | next_term = i; 15 | else 16 | { 17 | next_term = first_term + second_term; 18 | first_term = second_term; 19 | second_term = next_term; 20 | } 21 | printf("%d\n",next_term); 22 | } 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Find even and odd number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Find missing number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | /* getMissingNo takes array and size of array as arguments*/ 4 | int getMissingNo(int a[], int n) 5 | { 6 | int i, total; 7 | total = (n + 1) * (n + 2) / 2; 8 | for (i = 0; i < n; i++) 9 | total -= a[i]; 10 | return total; 11 | } 12 | 13 | /*program to test above function */ 14 | int main() 15 | { 16 | int a[] = { 1, 2, 4, 5, 6 }; 17 | int miss = getMissingNo(a, 5); 18 | printf("%d", miss); 19 | getchar(); 20 | } 21 | -------------------------------------------------------------------------------- /Find odd or even no: -------------------------------------------------------------------------------- 1 | /* Program to check whether the input integer number 2 | * is even or odd using the modulus operator (%) 3 | */ 4 | #include 5 | int main() 6 | { 7 | // This variable is to store the input number 8 | int num; 9 | 10 | printf("Enter an integer: "); 11 | scanf("%d",&num); 12 | 13 | // Modulus (%) returns remainder 14 | if ( num%2 == 0 ) 15 | printf("%d is an even number", num); 16 | else 17 | printf("%d is an odd number", num); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /First small letter in string: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | main() 4 | { 5 | int i,flag=0; 6 | char str[100]; 7 | printf("Enter String to get First Small Letter of String\n"); 8 | gets(str); 9 | for(i=0;i'a' && str[i]<'z') 12 | { 13 | printf("The First Small Letter is %c\n",str[i]); 14 | flag=1; 15 | break; 16 | } 17 | } 18 | if(flag!=1) 19 | printf("There is no small letter\n"); 20 | } 21 | -------------------------------------------------------------------------------- /Funnystring: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int q,i,len; 8 | char str[10000],r[10000]; 9 | scanf("%d",&q); 10 | while(q!=0) 11 | { 12 | scanf("%s",str); 13 | len=strlen(str); 14 | for (i = 0; i < len; i++) 15 | { 16 | r[i] = str[strlen(str) - i - 1]; 17 | } 18 | int flag=1; 19 | for (i = 1; i < len; i++) 20 | { 21 | if (abs(r[i] - r[i-1]) != abs(str[i] - str[i-1])) 22 | { 23 | printf("Not Funny\n"); 24 | flag=0; 25 | break; 26 | } 27 | } 28 | 29 | if (flag==1) 30 | printf("Funny\n"); 31 | q--; 32 | } 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /GCD Of numbers: -------------------------------------------------------------------------------- 1 | import Scanner.*; 2 | public class GCD { 3 | 4 | public static void main(String[] args) { 5 | Scanner s=new Scanner(System.in); 6 | int n1=s.nextInt(); 7 | int n2=s.nextInt(); 8 | int gcd = 1; 9 | 10 | for(int i = 1; i <= n1 && i <= n2; ++i) 11 | { 12 | // Checks if i is factor of both integers 13 | if(n1 % i==0 && n2 % i==0) 14 | gcd = i; 15 | } 16 | 17 | System.out.printf("G.C.D of %d and %d is %d", n1, n2, gcd); 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /GCD of 2 number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n1, n2; 5 | 6 | printf("Enter two positive integers: "); 7 | scanf("%d %d",&n1,&n2); 8 | 9 | while(n1!=n2) 10 | { 11 | if(n1 > n2) 12 | n1 -= n2; 13 | else 14 | n2 -= n1; 15 | } 16 | printf("GCD = %d",n1); 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /GREATER NO.: -------------------------------------------------------------------------------- 1 | int main() { 2 | double n1, n2, n3; 3 | printf("Enter three different numbers: "); 4 | scanf("%lf %lf %lf", &n1, &n2, &n3); 5 | 6 | // if n1 is greater than both n2 and n3, n1 is the largest 7 | if (n1 >= n2 && n1 >= n3) 8 | printf("%.2f is the largest number.", n1); 9 | 10 | // if n2 is greater than both n1 and n3, n2 is the largest 11 | if (n2 >= n1 && n2 >= n3) 12 | printf("%.2f is the largest number.", n2); 13 | 14 | // if n3 is greater than both n1 and n2, n3 is the largest 15 | if (n3 >= n1 && n3 >= n2) 16 | printf("%.2f is the largest number.", n3); 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Gcd of any number using recursion in c: -------------------------------------------------------------------------------- 1 | #include 2 | int GetGCD(int temp1,int temp2); 3 | main() 4 | { 5 | int num1,num2,gcd,lcm,x; 6 | printf("Enter number 1 and number 2\n"); 7 | scanf("%d%d",&num1,&num2); 8 | gcd=GetGCD(num1,num2); 9 | lcm=(num1*num2)/gcd; 10 | printf("gcd is %d\n",gcd); 11 | printf("Lcm is %d\n",lcm); 12 | 13 | } 14 | int GetGCD(int temp1,int temp2) 15 | { 16 | if(temp2!=0) 17 | { 18 | GetGCD(temp2,temp1%temp2); 19 | 20 | } 21 | else 22 | { 23 | return(temp1); 24 | 25 | } 26 | 27 | } 28 | 29 | 30 | -------------------------------------------------------------------------------- /Gcdrecursion.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int hcf(int n1, int n2); 3 | int main() { 4 | int n1, n2; 5 | printf("Enter two positive integers: "); 6 | scanf("%d %d", &n1, &n2); 7 | printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1, n2)); 8 | return 0; 9 | } 10 | 11 | int hcf(int n1, int n2) { 12 | if (n2 != 0) 13 | return hcf(n2, n1 % n2); 14 | else 15 | return n1; 16 | } 17 | -------------------------------------------------------------------------------- /Greater Integer: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main(){ 5 | int a,b; 6 | cin>>a>>b; 7 | cout< 4 | 5 | int main() { 6 | int a, b; 7 | printf("Please Enter Two different values\n"); 8 | scanf("%d %d", &a, &b); 9 | 10 | if(a > b) 11 | { 12 | printf("%d is Largest\n", a); 13 | } 14 | else if (b > a) 15 | { 16 | printf("%d is Largest\n", b); 17 | } 18 | else 19 | { 20 | printf("Both are Equal\n"); 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /GreaterNumber: -------------------------------------------------------------------------------- 1 | /* C Program to Find Largest of Two numbers */ 2 | 3 | #include 4 | 5 | int main() { 6 | int a, b; 7 | printf("Please Enter Two different values\n"); 8 | scanf("%d %d", &a, &b); 9 | 10 | if(a > b) 11 | { 12 | printf("%d is Largest\n", a); 13 | } 14 | else if (b > a) 15 | { 16 | printf("%d is Largest\n", b); 17 | } 18 | else 19 | { 20 | printf("Both are Equal\n"); 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Greaterbhai: -------------------------------------------------------------------------------- 1 | include 2 | #include 3 | void main() 4 | { 5 | 6 | int n1,n2,sum; 7 | clrscr(); 8 | 9 | printf("\nEnter 1st number : "); 10 | scanf("%d",&n1); 11 | 12 | printf("\nEnter 2nd number : "); 13 | scanf("%d",&n2); 14 | 15 | if(n1 > n2) 16 | printf("\n1st number is greatest."); 17 | else 18 | printf("\n2nd number is greatest."); 19 | 20 | getch(); 21 | } 22 | 23 | Output : 24 | 25 | Enter 1st number : 115 26 | Enter 2nd number : 228 27 | 2nd number is greatest. 28 | -------------------------------------------------------------------------------- /Greaterno: -------------------------------------------------------------------------------- 1 | // C program to find the greatest of two numbers 2 | 3 | #include 4 | int main() 5 | { 6 | //Fill the code 7 | int num1, num2; 8 | scanf(“%d %d”,&num1,&num2); 9 | if(num1 > num2) 10 | { 11 | printf(“%d is greater”,num1); 12 | } 13 | else 14 | { 15 | printf(“%d is greater”,num2); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Greaternumber: -------------------------------------------------------------------------------- 1 | int main(void) 2 | 3 | { 4 | 5 | 6 | int num1,num2; 7 | 8 | printf("Enter two numbers:"); 9 | scanf("%d %d",&num1,&num2); 10 | 11 | 12 | if(num1>num2) 13 | 14 | 15 | { 16 | 17 | printf("%d is greatest",num1); 18 | 19 | 20 | } 21 | 22 | 23 | else if(num2>num1) 24 | 25 | 26 | { 27 | 28 | 29 | printf("%d is greatest",num2); 30 | 31 | 32 | } 33 | 34 | 35 | else 36 | 37 | 38 | { 39 | 40 | 41 | printf("%d and %d are equal",num1,num2); 42 | 43 | 44 | } 45 | 46 | 47 | return 0; 48 | 49 | 50 | } 51 | -------------------------------------------------------------------------------- /Greatest No.: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main() 4 | { 5 | int num1, num2, num3; 6 | 7 | printf("Enter the values of num1, num2 and num3\n"); 8 | scanf("%d %d %d", &num1, &num2, &num3); 9 | printf("num1 = %d\tnum2 = %d\tnum3 = %d\n", num1, num2, num3); 10 | if (num1 > num2) 11 | { 12 | if (num1 > num3) 13 | { 14 | printf("num1 is the greatest among three \n"); 15 | } 16 | else 17 | { 18 | printf("num3 is the greatest among three \n"); 19 | } 20 | } 21 | else if (num2 > num3) 22 | printf("num2 is the greatest among three \n"); 23 | else 24 | printf("num3 is the greatest among three \n"); 25 | } 26 | -------------------------------------------------------------------------------- /Half pyramid of *: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, j, rows; 4 | printf("Enter the number of rows: "); 5 | scanf("%d", &rows); 6 | for (i = 1; i <= rows; ++i) { 7 | for (j = 1; j <= i; ++j) { 8 | printf("* "); 9 | } 10 | printf("\n"); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /Hello world Program: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | // printf() displays the string inside quotation 4 | printf("Hello, World!"); 5 | return 0; 6 | } 7 | 8 | Output 9 | Hello, World! 10 | -------------------------------------------------------------------------------- /Hello, World: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | printf("Hello, World"); 4 | return 0; 5 | } 6 | -------------------------------------------------------------------------------- /Identifies_missing_numbers: -------------------------------------------------------------------------------- 1 | /* 2 | * C Program to identify missing numbers in a given array 3 | */ 4 | #include 5 | 6 | void main() 7 | { 8 | int n, i, j, c, t, b; 9 | 10 | printf("Enter size of array : "); 11 | scanf("%d", &n); 12 | int array[n - 1]; /* array size-1 */ 13 | printf("Enter elements into array : \n"); 14 | for (i = 0; i < n - 1; i++) 15 | scanf("%d", &array[i]); 16 | b = array[0]; 17 | for (i = 1; i < n - 1; i++) 18 | b = b ^ array[i]; 19 | for (i = 2, c = 1; i <= n; i++) 20 | c = c ^ i; 21 | c = c ^ b; 22 | printf("Missing element is : %d \n", c); 23 | } 24 | -------------------------------------------------------------------------------- /Indian Flag: -------------------------------------------------------------------------------- 1 | main() 2 | { 3 | int a,b,c; 4 | int count = 1; 5 | 6 | for (b = c = 10; 7 | a = "- FIGURE?, UMKC,XYZHello Folks,\ 8 | TFy!QJu ROo TNn(ROo)SLq SLq ULo+\ 9 | UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\ 10 | NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\ 11 | HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\ 12 | T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\ 13 | Hq!WFs XDt!"[b+++21]; ) 14 | for(; a-- > 64 ; ) 15 | putchar ( ++c=='Z' ? c = c/ 9:33^b&1); 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /LCM: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int Num1, Num2, max_Value; 6 | 7 | printf("Please Enter two integer Values \n"); 8 | scanf("%d %d", &Num1, &Num2); 9 | 10 | max_Value = (Num1 > Num2)? Num1 : Num2; 11 | 12 | while(1) //Alway True 13 | { 14 | if(max_Value % Num1 == 0 && max_Value % Num2 == 0) 15 | { 16 | printf("LCM of %d and %d = %d", Num1, Num2, max_Value); 17 | break; 18 | } 19 | ++max_Value; 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /LRU_Cache.cpp: -------------------------------------------------------------------------------- 1 | class LRUCache { 2 | private: 3 | int cap; 4 | list keys; 5 | unordered_map::iterator>> cache; 6 | public: 7 | LRUCache(int capacity) { 8 | cap = capacity; 9 | } 10 | 11 | int get(int key) { 12 | if(cache.find(key) != cache.end()){ 13 | keys.erase(cache[key].second); 14 | keys.push_front(key); 15 | cache[key].second = keys.begin(); 16 | return cache[key].first; 17 | } 18 | return -1; 19 | } 20 | 21 | void put(int key, int value) { 22 | if(cache.find(key) != cache.end()){ 23 | keys.erase(cache[key].second); 24 | keys.push_front(key); 25 | cache[key] = {value, keys.begin()}; 26 | }else{ 27 | if(keys.size() == cap){ 28 | cache.erase(keys.back()); 29 | keys.pop_back(); 30 | } 31 | keys.push_front(key); 32 | cache[key] = {value, keys.begin()}; 33 | } 34 | } 35 | }; 36 | -------------------------------------------------------------------------------- /LargestNo.: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double n1, n2, n3; 4 | printf("Enter three different numbers: "); 5 | scanf("%lf %lf %lf", &n1, &n2, &n3); 6 | 7 | // if n1 is greater than both n2 and n3, n1 is the largest 8 | if (n1 >= n2 && n1 >= n3) 9 | printf("%.2f is the largest number.", n1); 10 | 11 | // if n2 is greater than both n1 and n3, n2 is the largest 12 | if (n2 >= n1 && n2 >= n3) 13 | printf("%.2f is the largest number.", n2); 14 | 15 | // if n3 is greater than both n1 and n2, n3 is the largest 16 | if (n3 >= n1 && n3 >= n2) 17 | printf("%.2f is the largest number.", n3); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Leap Year: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | 7 | // leap year if perfectly visible by 400 8 | if (year % 400 == 0) { 9 | printf("%d is a leap year.", year); 10 | } 11 | // not a leap year if visible by 100 12 | // but not divisible by 400 13 | else if (year % 100 == 0) { 14 | printf("%d is not a leap year.", year); 15 | } 16 | // leap year if not divisible by 100 17 | // but divisible by 4 18 | else if (year % 4 == 0) { 19 | printf("%d is a leap year.", year); 20 | } 21 | // all other years are not leap year 22 | else { 23 | printf("%d is not a leap year.", year); 24 | } 25 | 26 | getch(); 27 | } 28 | -------------------------------------------------------------------------------- /Leap Year Checker: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int y; 5 | 6 | printf("Enter year: "); 7 | scanf("%d",&y); 8 | 9 | if(y % 4 == 0) 10 | { 11 | //Nested if else 12 | if( y % 100 == 0) 13 | { 14 | if ( y % 400 == 0) 15 | printf("%d is a Leap Year", y); 16 | else 17 | printf("%d is not a Leap Year", y); 18 | } 19 | else 20 | printf("%d is a Leap Year", y ); 21 | } 22 | else 23 | printf("%d is not a Leap Year", y); 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /Linked List traversal: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | 5 | void main() 6 | struct node 7 | { 8 | int data; 9 | struct node *next; 10 | }; 11 | 12 | struct node *head,*newnode,*temp; 13 | 14 | head=0,temp=0; 15 | 16 | int choice; 17 | 18 | while (choice){ 19 | newnode = (struct node*)malloc(sizeof(struct node)) 20 | 21 | printf("Enter data") 22 | 23 | scanf("%d",&newnode->data); 24 | newnode->next=0; 25 | 26 | if(head==0) 27 | { 28 | head=temp=newnode; 29 | } 30 | else 31 | { 32 | temp->next=newnode; 33 | temp=newnode; 34 | } 35 | 36 | printf("Do you want to continue (0,1)?"); 37 | scanf("%d",&choice); 38 | 39 | /////////////////displaying/////////////// 40 | 41 | 42 | temp=head; 43 | while(temp!=0) 44 | { 45 | printf("%d",temp->data); 46 | temp=temp->next; 47 | } 48 | getch(); 49 | 50 | } 51 | 52 | 53 | 54 | 55 | -------------------------------------------------------------------------------- /Liquidityno: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int a[10]; 4 | int i; 5 | int greatest; 6 | printf("Enter ten values:"); 7 | //Store 10 numbers in an array 8 | for (i = 0; i < 10; i++) { 9 | scanf("%d", &a[i]); 10 | } 11 | //Assume that a[0] is greatest 12 | greatest = a[0]; 13 | for (i = 0; i < 10; i++) { 14 | if (a[i] > greatest) { 15 | greatest = a[i]; 16 | } 17 | } 18 | printf(" 19 | Greatest of ten numbers is %d", greatest); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Maxof3: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a,b,c,max; 5 | cout<<"Enter 3 numbers: "<>a>>b>>c; 7 | cout<<"The max between a,b and c is: " 8 | if(a>b) 9 | { 10 | max=a; 11 | } 12 | if(b>a) 13 | { 14 | max=b; 15 | } 16 | if(c>max) 17 | { 18 | max=c; 19 | } 20 | cout< 2 | int main() 3 | { 4 | int x, y; 5 | printf("enter the value of x:"); 6 | scanf("%d", &x); 7 | printf("enter the value of y:"); 8 | scanf("%d", &y); 9 | if (x>y) 10 | { 11 | printf("x is greater than y\n"); 12 | } 13 | if (x 2 | int main() 3 | { 4 | int num1,num2,product; 5 | printf("Enter two numbers:"); 6 | scanf("%d %d",&num1,&num2); 7 | product=num1*num2; 8 | printf("Product of two numbers: %d",product); 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /N reverse natural number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int i, n; 6 | 7 | 8 | printf("Enter any number: "); 9 | scanf("%d", &n); 10 | 11 | printf("Natural numbers from 1 to %d : \n", n); 12 | 13 | 14 | for(i=n; i<=1; i--) 15 | { 16 | printf("%d\n", i); 17 | } 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Neon: -------------------------------------------------------------------------------- 1 | #include 2 | int isNeon(int num) 3 | { 4 | //storing the square of x 5 | int square = 0; 6 | //Store sum of digits (square number) 7 | int sum_digits = 0; 8 | //Calculate square of given number 9 | square = (num * num); 10 | while (square != 0) 11 | { 12 | sum_digits = (sum_digits + (square % 10)); 13 | square = (square / 10); 14 | } 15 | return (sum_digits == num); 16 | } 17 | int main() 18 | { 19 | int data = 0; 20 | int isNeonNumber = 0; 21 | //Ask to enter the number 22 | printf("Enter the number = "); 23 | scanf("%d",&data); 24 | // if is isNeonNumber is 1, then neon number 25 | isNeonNumber = isNeon(data); 26 | (isNeonNumber)? printf("neon number\n\n"):printf("Not a neon number\n\n"); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /Odd and even: -------------------------------------------------------------------------------- 1 | include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /OddEven: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Palindrome: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,r,sum=0,temp; 5 | printf("enter the number="); 6 | scanf("%d",&n); 7 | temp=n; 8 | while(n>0) 9 | { 10 | r=n%10; 11 | sum=(sum*10)+r; 12 | n=n/10; 13 | } 14 | if(temp==sum) 15 | printf("palindrome number "); 16 | else 17 | printf("not palindrome"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Palindrome Number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, reversedN = 0, remainder, originalN; 4 | printf("Enter an integer: "); 5 | scanf("%d", &n); 6 | originalN = n; 7 | 8 | // reversed integer is stored in reversedN 9 | while (n != 0) { 10 | remainder = n % 10; 11 | reversedN = reversedN * 10 + remainder; 12 | n /= 10; 13 | } 14 | 15 | // palindrome if orignalN and reversedN are equal 16 | if (originalN == reversedN) 17 | printf("%d is a palindrome.", originalN); 18 | else 19 | printf("%d is not a palindrome.", originalN); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Palindrome no.: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int num, rem, reverse_num, temp, start, end; 4 | 5 | printf("Enter the lower limit: "); 6 | scanf("%d",&start); 7 | 8 | printf("Enter the upper limit: "); 9 | scanf("%d",&end); 10 | 11 | printf("Palindrome numbers between %d and %d are: ",start,end); 12 | for(num=start;num<=end;num++){ 13 | temp=num; 14 | reverse_num=0; 15 | while(temp){ 16 | rem=temp%10; 17 | temp=temp/10; 18 | reverse_num=reverse_num*10+rem; 19 | } 20 | if(num==reverse_num) 21 | printf("%d ",num); 22 | } 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Pascal's Triangle: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int rows, coef = 1, space, i, j; 4 | printf("Enter the number of rows: "); 5 | scanf("%d", &rows); 6 | for (i = 0; i < rows; i++) { 7 | for (space = 1; space <= rows - i; space++) 8 | printf(" "); 9 | for (j = 0; j <= i; j++) { 10 | if (j == 0 || i == 0) 11 | coef = 1; 12 | else 13 | coef = coef * (i - j + 1) / j; 14 | printf("%4d", coef); 15 | } 16 | printf("\n"); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /PascalTriangle.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | vector> pascal(int numRows) { 7 | vector> res(numRows); 8 | for(int i=0;i>row; 21 | vector> res(row); 22 | res=pascal(row); 23 | for(int i=0;i 9 | int main() { 10 | int i, j, rows; 11 | printf("Enter the number of rows: "); 12 | scanf("%d", &rows); 13 | for (i = 1; i <= rows; ++i) { 14 | for (j = 1; j <= i; ++j) { 15 | printf("* "); 16 | } 17 | printf("\n"); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Perfect Number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int number, rem, sum = 0, i; 6 | 7 | printf("Enter a Number\n"); 8 | scanf("%d", &number); 9 | for (i = 1; i <= (number - 1); i++) 10 | { 11 | rem = number % i; 12 | if (rem == 0) 13 | { 14 | sum = sum + i; 15 | } 16 | } 17 | if (sum == number) 18 | printf("Entered Number is perfect number"); 19 | else 20 | printf("Entered Number is not a perfect number"); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Positive Negative Zero: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main() 4 | { 5 | int num; 6 | 7 | printf("Enter a number: \n"); 8 | scanf("%d", &num); 9 | if (num > 0) 10 | printf("%d is a positive number \n", num); 11 | else if (num < 0) 12 | printf("%d is a negative number \n", num); 13 | else 14 | printf("0 is neither positive nor negative"); 15 | } 16 | -------------------------------------------------------------------------------- /Positive or Negative: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int number; 6 | 7 | printf("Enter any number:\n"); 8 | scanf("%d",&number); 9 | 10 | if (number >= 0) 11 | { 12 | if (number > 0) 13 | printf("%d is Positive Number", number); 14 | else 15 | printf("You have entered Value zero."); 16 | } 17 | else 18 | printf("%d is Negative Number", number); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Prime Number in C: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n,i,m=0,flag=0; 4 | printf("Enter the number to check prime:"); 5 | scanf("%d",&n); 6 | m=n/2; 7 | for(i=2;i<=m;i++) 8 | { 9 | if(n%i==0) 10 | { 11 | printf("Number is not prime"); 12 | flag=1; 13 | break; 14 | } 15 | } 16 | if(flag==0) 17 | printf("Number is prime"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Prime number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /PrimeNumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n,i,m=0,flag=0; 4 | printf("Enter the number to check prime:"); 5 | scanf("%d",&n); 6 | m=n/2; 7 | for(i=2;i<=m;i++) 8 | { 9 | if(n%i==0) 10 | { 11 | printf("Number is not prime"); 12 | flag=1; 13 | break; 14 | } 15 | } 16 | if(flag==0) 17 | printf("Number is prime"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Print Upper case Lower case alphabet: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | 5 | { 6 | 7 | char ch,ch1; 8 | 9 | for(ch='a';ch<='z';ch++) 10 | 11 | { 12 | 13 | printf("%c %c\n",ch,ch-32); 14 | 15 | } 16 | 17 | } 18 | 19 | With ascii 20 | 21 | #include 22 | 23 | int main() 24 | 25 | { 26 | 27 | char ch; 28 | 29 | for(ch='a';ch<='z';ch++) 30 | 31 | { 32 | 33 | printf("%c %c %d %d\n",ch,ch-32,ch,ch-32); 34 | 35 | } 36 | 37 | } 38 | -------------------------------------------------------------------------------- /Print numbers: -------------------------------------------------------------------------------- 1 | // Print numbers from 1 to 10 2 | #include 3 | 4 | int main() { 5 | int i; 6 | 7 | for (i = 1; i < 11; ++i) 8 | { 9 | printf("%d ", i); 10 | } 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /Product: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | 5 | int main() 6 | 7 | { 8 | 9 | int a,b; 10 | 11 | printf("first:"); 12 | 13 | scanf("%d",&a); 14 | 15 | printf("second:"); 16 | 17 | scanf("%d",&b); 18 | 19 | int c=a*b; 20 | 21 | printf("product:%d",c); 22 | 23 | return 0; 24 | 25 | } 26 | -------------------------------------------------------------------------------- /Product of two No.: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void main(){ 5 | 6 | int one, two, multiply; 7 | 8 | printf("Enter first number - "); 9 | 10 | scanf("%d",&one); 11 | 12 | printf("Enter second number - "); 13 | 14 | scanf("%d",&two); 15 | 16 | multiply = one * two; 17 | 18 | printf("The multiplication of numbers %d and %d is %d",one,two,multiply); 19 | 20 | getch(); 21 | 22 | } 23 | -------------------------------------------------------------------------------- /Program of Fibonacci Series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Program of adding two number in c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int x, y, z; 5 | 6 | printf("Enter two numbers to add\n"); 7 | scanf("%d%d", &x, &y); 8 | 9 | z = x + y; 10 | 11 | printf("Sum of the numbers = %d\n", z); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Program to Add Two Matrices: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int r, c, a[100][100], b[100][100], sum[100][100], i, j; 4 | printf("Enter the number of rows (between 1 and 100): "); 5 | scanf("%d", &r); 6 | printf("Enter the number of columns (between 1 and 100): "); 7 | scanf("%d", &c); 8 | 9 | printf("\nEnter elements of 1st matrix:\n"); 10 | for (i = 0; i < r; ++i) 11 | for (j = 0; j < c; ++j) { 12 | printf("Enter element a%d%d: ", i + 1, j + 1); 13 | scanf("%d", &a[i][j]); 14 | } 15 | 16 | printf("Enter elements of 2nd matrix:\n"); 17 | for (i = 0; i < r; ++i) 18 | for (j = 0; j < c; ++j) { 19 | printf("Enter element a%d%d: ", i + 1, j + 1); 20 | scanf("%d", &b[i][j]); 21 | } 22 | 23 | // adding two matrices 24 | for (i = 0; i < r; ++i) 25 | for (j = 0; j < c; ++j) { 26 | sum[i][j] = a[i][j] + b[i][j]; 27 | } 28 | -------------------------------------------------------------------------------- /Program to Check Prime Number: -------------------------------------------------------------------------------- 1 | #Program to Check Prime Number 2 | #include 3 | int main() { 4 | int n, i, flag = 0; 5 | printf("Enter a positive integer: "); 6 | scanf("%d", &n); 7 | 8 | for (i = 2; i <= n / 2; ++i) { 9 | 10 | // condition for non-prime 11 | if (n % i == 0) { 12 | flag = 1; 13 | break; 14 | } 15 | } 16 | 17 | if (n == 1) { 18 | printf("1 is neither prime nor composite."); 19 | } 20 | else { 21 | if (flag == 0) 22 | printf("%d is a prime number.", n); 23 | else 24 | printf("%d is not a prime number.", n); 25 | } 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /Program to Reverse a String Using Recursion: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | // declaring recursive function 5 | char* reverse(char* str); 6 | 7 | void main() 8 | { 9 | int i, j, k; 10 | char str[100]; 11 | char *rev; 12 | printf("Enter the string:\t"); 13 | scanf("%s", str); 14 | printf("The original string is: %s\n", str); 15 | rev = reverse(str); 16 | printf("The reversed string is: %s\n", rev); 17 | getch(); 18 | } 19 | 20 | // defining the function 21 | char* reverse(char *str) 22 | { 23 | static int i = 0; 24 | static char rev[100]; 25 | if(*str) 26 | { 27 | reverse(str+1); 28 | rev[i++] = *str; 29 | } 30 | return rev; 31 | } 32 | -------------------------------------------------------------------------------- /Program to convert binary to decimal.c: -------------------------------------------------------------------------------- 1 | include 2 | #include 3 | int binaryToDecimal(long binarynum) 4 | { 5 | int decimalnum = 0, temp = 0, remainder; 6 | while (binarynum!=0) 7 | { 8 | remainder = binarynum % 10; 9 | binarynum = binarynum / 10; 10 | decimalnum = decimalnum + remainder*pow(2,temp); 11 | temp++; 12 | } 13 | return decimalnum; 14 | } 15 | 16 | int main() 17 | { 18 | long binarynum; 19 | printf("Enter a binary number: "); 20 | scanf("%ld", &binarynum); 21 | 22 | printf("Equivalent decimal number is: %d", binaryToDecimal(binarynum)); 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # cprogram - An Amazing Project 2 | # The CP is a framework of international education that incorporates the values of the IB into a unique programme addressing the needs of students engaged in career-related education. 3 | -------------------------------------------------------------------------------- /RECURSION: -------------------------------------------------------------------------------- 1 | #include 2 | int fact (int); 3 | int main() 4 | { 5 | int n,f; 6 | printf("Enter the number whose factorial you want to calculate?"); 7 | scanf("%d",&n); 8 | f = fact(n); 9 | printf("factorial = %d",f); 10 | } 11 | int fact(int n) 12 | { 13 | if (n==0) 14 | { 15 | return 0; 16 | } 17 | else if ( n == 1) 18 | { 19 | return 1; 20 | } 21 | else 22 | { 23 | return n*fact(n-1); 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /ReadWrite.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() { 8 | 9 | ofstream MyFile("sample.txt"); 10 | 11 | cout<<"Writing into a file\n"; 12 | 13 | string data; 14 | 15 | cout<<"Enter your name : \n"; 16 | 17 | cin>>data; 18 | 19 | 20 | 21 | MyFile << data << endl; 22 | 23 | cout<<"Enter your age : "; 24 | 25 | cin>>data; 26 | 27 | MyFile << data << endl; 28 | 29 | 30 | 31 | MyFile.close(); 32 | 33 | string myText; 34 | 35 | ifstream MyReadFile("sample.txt"); 36 | 37 | cout<<"Reading from a file\n"; 38 | 39 | while (getline (MyReadFile, myText)) { 40 | 41 | cout << myText< 2 | #include 3 | 4 | using namespace std; 5 | 6 | 7 | int main(){ 8 | int N; 9 | cin >> N; 10 | list names; 11 | for(int a0 = 0; a0 < N; a0++){ 12 | string firstName; 13 | string emailID; 14 | cin >> firstName >> emailID; 15 | if (regex_match (emailID, regex(".+@gmail.com") )){ 16 | names.push_back(firstName); 17 | } 18 | } 19 | names.sort(); 20 | while (!names.empty()) 21 | { 22 | cout << names.front()< 2 | #include 3 | main() 4 | { 5 | int i=0,flag=0,len1,len2,j,k=0; 6 | char str1[100],str2[100],temp[100]={0}; 7 | printf("Enter a string 1\n"); 8 | gets(str1); 9 | printf("Enter a string 2\n"); 10 | gets(str2); 11 | len1=strlen(str1); 12 | len2=strlen(str2); 13 | 14 | for(i=0;i 2 | int main() { 3 | int n, rev = 0, remainder; 4 | printf("Enter an integer: "); 5 | scanf("%d", &n); 6 | while (n != 0) { 7 | remainder = n % 10; 8 | rev = rev * 10 + remainder; 9 | n /= 10; 10 | } 11 | printf("Reversed number = %d", rev); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /Reverseno.: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, rev = 0, remainder; 4 | printf("Enter an integer: "); 5 | scanf("%d", &n); 6 | while (n != 0) { 7 | remainder = n % 10; 8 | rev = rev * 10 + remainder; 9 | n /= 10; 10 | } 11 | printf("Reversed number = %d", rev); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /SMALLNO: -------------------------------------------------------------------------------- 1 | #define DELTA 1e-11 2 | .... 3 | 4 | if (abs(b-a) <= DELTA) { 5 | (expression); 6 | } 7 | -------------------------------------------------------------------------------- /Second Largest Element in Array: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int array[10] = {101, 11, 3, 4, 50, 69, 7, 8, 9, 0}; 5 | int loop, largest, second; 6 | 7 | if(array[0] > array[1]) { 8 | largest = array[0]; 9 | second = array[1]; 10 | } else { 11 | largest = array[1]; 12 | second = array[0]; 13 | } 14 | 15 | for(loop = 2; loop < 10; loop++) { 16 | if( largest < array[loop] ) { 17 | second = largest; 18 | largest = array[loop]; 19 | } else if( second < array[loop] ) { 20 | second = array[loop]; 21 | } 22 | } 23 | 24 | printf("Largest - %d \nSecond - %d \n", largest, second); 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Selection Sort Program in C: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | /* Here i & j for loop counters, temp for swapping, 4 | * count for total number of elements, number[] to 5 | * store the input numbers in array. You can increase 6 | * or decrease the size of number array as per requirement 7 | */ 8 | int i, j, count, temp, number[25]; 9 | 10 | printf("How many numbers u are going to enter?: "); 11 | scanf("%d",&count); 12 | 13 | printf("Enter %d elements: ", count); 14 | // Loop to get the elements stored in array 15 | for(i=0;inumber[j]){ 22 | temp=number[i]; 23 | number[i]=number[j]; 24 | number[j]=temp; 25 | } 26 | } 27 | } 28 | 29 | printf("Sorted elements: "); 30 | for(i=0;i 2 | int main(){ 3 | /* Here i & j for loop counters, temp for swapping, 4 | * count for total number of elements, number[] to 5 | * store the input numbers in array. You can increase 6 | * or decrease the size of number array as per requirement 7 | */ 8 | int i, j, count, temp, number[25]; 9 | 10 | printf("How many numbers u are going to enter?: "); 11 | scanf("%d",&count); 12 | 13 | printf("Enter %d elements: ", count); 14 | // Loop to get the elements stored in array 15 | for(i=0;inumber[j]){ 22 | temp=number[i]; 23 | number[i]=number[j]; 24 | number[j]=temp; 25 | } 26 | } 27 | } 28 | 29 | printf("Sorted elements: "); 30 | for(i=0;i 2 | #include 3 | void main() 4 | { 5 | int p,r,t,i; 6 | float si; 7 | printf("\n enter Principle amount,rate,time"); 8 | scanf("%d%d%d"&p,&r,&t); 9 | si=(p*r*t)/100; 10 | getch(); 11 | } 12 | -------------------------------------------------------------------------------- /Simple calculator: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /SimpleCalci: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /Smaller Number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a[30], i, num, smallest; 5 | 6 | printf("\nEnter no of elements :"); 7 | scanf("%d", &num); 8 | 9 | //Read n elements in an array 10 | for (i = 0; i < num; i++) 11 | scanf("%d", &a[i]); 12 | 13 | //Consider first element as smallest 14 | smallest = a[0]; 15 | 16 | for (i = 0; i < num; i++) { 17 | if (a[i] < smallest) { 18 | smallest = a[i]; 19 | } 20 | } 21 | 22 | // Print out the Result 23 | printf("\nSmallest Element : %d", smallest); 24 | 25 | return (0); 26 | } 27 | -------------------------------------------------------------------------------- /Smaller number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a[10], Size, i, Smallest, Position; 5 | 6 | printf("\nPlease Enter the size of an array \n"); 7 | scanf("%d",&Size); 8 | 9 | printf("\nPlease Enter %d elements of an array: \n", Size); 10 | for(i=0; i a[i]) 19 | { 20 | Smallest = a[i]; 21 | Position = i; 22 | } 23 | } 24 | 25 | printf("\nSmallest element in an Array = %d", Smallest); 26 | printf("\nIndex position of the Smallest element = %d", Position); 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /Smallest: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | int main(void) 5 | { 6 | 7 | int num1,num2; 8 | 9 | printf("Enter two numbers:"); 10 | scanf("%d %d",&num1,&num2); 11 | 12 | if(num1 2 | 3 | int main() { 4 | int a[30], i, num, smallest; 5 | 6 | printf("\nEnter no of elements :"); 7 | scanf("%d", &num); 8 | 9 | //Read n elements in an array 10 | for (i = 0; i < num; i++) 11 | scanf("%d", &a[i]); 12 | 13 | //Consider first element as smallest 14 | smallest = a[0]; 15 | 16 | for (i = 0; i < num; i++) { 17 | if (a[i] < smallest) { 18 | smallest = a[i]; 19 | } 20 | } 21 | 22 | // Print out the Result 23 | printf("\nSmallest Element : %d", smallest); 24 | 25 | return (0); 26 | } 27 | -------------------------------------------------------------------------------- /Sort in Descending order: -------------------------------------------------------------------------------- 1 | #include 2 | void main () 3 | { 4 | int number[30]; 5 | 6 | int i, j, a, n; 7 | printf("Enter the value of N\n"); 8 | scanf("%d", &n); 9 | 10 | printf("Enter the numbers \n"); 11 | for (i = 0; i < n; ++i) 12 | scanf("%d", &number[i]); 13 | 14 | for (i = 0; i < n; ++i) 15 | { 16 | for (j = i + 1; j < n; ++j) 17 | { 18 | if (number[i] < number[j]) 19 | { 20 | a = number[i]; 21 | number[i] = number[j]; 22 | number[j] = a; 23 | } 24 | } 25 | } 26 | 27 | printf("The numbers arranged in descending order are given below\n"); 28 | 29 | for (i = 0; i < n; ++i) 30 | { 31 | printf("%d\n", number[i]); 32 | } 33 | 34 | } 35 | -------------------------------------------------------------------------------- /Sorting Arrays: -------------------------------------------------------------------------------- 1 | /* 2 | * C program to accept N numbers and arrange them in an ascending order 3 | */ 4 | 5 | #include 6 | void main() 7 | { 8 | 9 | int i, j, a, n, number[30]; 10 | printf("Enter the value of N \n"); 11 | scanf("%d", &n); 12 | 13 | printf("Enter the numbers \n"); 14 | for (i = 0; i < n; ++i) 15 | scanf("%d", &number[i]); 16 | 17 | for (i = 0; i < n; ++i) 18 | { 19 | 20 | for (j = i + 1; j < n; ++j) 21 | { 22 | 23 | if (number[i] > number[j]) 24 | { 25 | 26 | a = number[i]; 27 | number[i] = number[j]; 28 | number[j] = a; 29 | 30 | } 31 | 32 | } 33 | 34 | } 35 | 36 | printf("The numbers arranged in ascending order are given below \n"); 37 | for (i = 0; i < n; ++i) 38 | printf("%d\n", number[i]); 39 | 40 | } 41 | -------------------------------------------------------------------------------- /SquareFill with stars: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | 5 | { 6 | int i,j; 7 | 8 | clrscr(); for(i=1;i<=5;i++) 9 | 10 | { 11 | 12 | for(j=1;j<=5;j++) 13 | 14 | { 15 | 16 | printf("*"); 17 | 18 | } 19 | 20 | printf("\n"); 21 | 22 | } 23 | 24 | getch(); 25 | 26 | } 27 | -------------------------------------------------------------------------------- /Squareroot: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | void main() 5 | { 6 | float x,y; 7 | clrscr(); 8 | printf("Enter the number \n"); 9 | scanf("%f",&x); 10 | y-sqrt(x); 11 | printf("Square root of %f \n",x,y); 12 | getch(); 13 | } 14 | -------------------------------------------------------------------------------- /Star Pattern: -------------------------------------------------------------------------------- 1 | #include 2 | int main(void) { 3 | int n; 4 | printf("Enter the number of rows\n"); 5 | scanf("%d",&n); 6 | int spaces=n-1; 7 | int stars=1; 8 | for(int i=1;i<=n;i++) 9 | { 10 | for(int j=1;j<=spaces;j++) 11 | { 12 | printf(" "); 13 | } 14 | for(int k=1;k<=stars;k++) 15 | { 16 | printf("*"); 17 | } 18 | if(spaces>i) 19 | { 20 | spaces=spaces-1; 21 | stars=stars+2; 22 | } 23 | if(spaces 2 | #include 3 | #include 4 | 5 | void main(){ 6 | 7 | int n,i,j; 8 | printf("Enter the value of n: "); 9 | scanf("%d",&n); 10 | 11 | for( i = 0; i < n ; i++){ // upper part 12 | 13 | for ( j = 1; j <= 6*n-1 ; j++) 14 | { 15 | if( ( j >= n - i && j <= 2*n + i ) || ( j >= 4*n - i && j <= 5*n +i ) ){ 16 | printf("*"); 17 | }else { 18 | printf(" "); 19 | } 20 | 21 | } 22 | 23 | printf("\n"); 24 | } 25 | 26 | for( i = 0; i < 3*n ; i++){ // lower part 27 | 28 | for ( j = 1; j <= 6*n-1 ; j++) 29 | { 30 | if(j >= 1 + i && j <= 6*n - i){ 31 | printf("*"); 32 | }else { 33 | printf(" "); 34 | } 35 | 36 | } 37 | 38 | printf("\n"); 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /Stock_Span: -------------------------------------------------------------------------------- 1 | #include 2 | int* stockSpan(int *price, int size) { 3 | // Write your code here 4 | stack st; 5 | st.push(0); 6 | int *S=new int[size]; 7 | // Span value of first element 8 | S[0] = 1; 9 | // Span values for rest of the elements 10 | for (int i = 1; i < size; i++){ 11 | while (!st.empty() && price[st.top()] < price[i]) 12 | st.pop(); 13 | 14 | if(st.empty()){ 15 | S[i] = i + 1; 16 | } 17 | else{ 18 | S[i] = i - st.top(); 19 | } 20 | 21 | // Push this element to stack 22 | st.push(i); 23 | } 24 | return S; 25 | 26 | } 27 | 28 | 29 | 30 | -------------------------------------------------------------------------------- /String reverse: -------------------------------------------------------------------------------- 1 | // Created by rjkalash 2 | 3 | #include 4 | #include 5 | int main() 6 | { 7 | char mess[80], stress[80]; 8 | int i,j,len; 9 | printf("Enter any string:"); 10 | scanf("%s",&mess); 11 | j=0; 12 | len=strlen(mess); 13 | for (i=len-1;i>=0;i--) 14 | { 15 | stress[j++]=mess[i]; 16 | } 17 | stress[j]='\0'; 18 | printf ("the reversed string is =%s",stress); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Sum: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Sum of Two numbers: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a, b, sum; 5 | 6 | printf("\nEnter two no: "); 7 | scanf("%d %d", &a, &b); 8 | 9 | sum = a + b; 10 | 11 | printf("Sum : %d", sum); 12 | 13 | return(0); 14 | } 15 | -------------------------------------------------------------------------------- /Sum of two number: -------------------------------------------------------------------------------- 1 | include 2 | int main() 3 | { 4 | int x, y, z; 5 | 6 | printf("Enter two numbers to add\n"); 7 | scanf("%d%d", &x, &y); 8 | 9 | z = x + y; 10 | 11 | printf("Sum of the numbers = %d\n", z); 12 | 13 | return 0; 14 | -------------------------------------------------------------------------------- /SumOfTwoNumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a, b, sum; 5 | printf("\nEnter two no: "); 6 | scanf("%d %d", &a, &b); 7 | sum = a + b; 8 | printf("Sum : %d", sum); 9 | return(0); 10 | } 11 | -------------------------------------------------------------------------------- /Swap 2 numbers: -------------------------------------------------------------------------------- 1 | // C program to swap two variables 2 | #include 3 | 4 | int main() 5 | { 6 | int x, y; 7 | printf("Enter Value of x "); 8 | scanf("%d", &x); 9 | printf("\nEnter Value of y "); 10 | scanf("%d", &y); 11 | 12 | int temp = x; 13 | x = y; 14 | y = temp; 15 | 16 | printf("\nAfter Swapping: x = %d, y = %d", x, y); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Swapnumbers: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | 5 | { 6 | 7 | int a=10, b=20; 8 | 9 | printf("Before swap a=%d b=%d",a,b); 10 | 11 | a=a+b;//a=30 (10+20) 12 | 13 | b=a-b;//b=10 (30-20) 14 | 15 | a=a-b;//a=20 (30-10) 16 | 17 | printf("\nAfter swap a=%d b=%d",a,b); 18 | 19 | return 0; 20 | 21 | } 22 | -------------------------------------------------------------------------------- /Swapping Two Numbers: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int a; 6 | int b; 7 | printf("Enter First Number"); 8 | scanf("%d",&a); 9 | printf("Enter Second Number"); 10 | scanf("%d",&b); 11 | printf("Before Swapping"); 12 | printf("Value of a is",a); 13 | printf("Value of b is",b); 14 | printf("After Swapping"); 15 | a=a+b; 16 | b=a-b; 17 | a=a-b; 18 | printf("Value of a is",a); 19 | printf("Value of b is",b); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Swapping of two number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double first, second, temp; 4 | printf("Enter first number: "); 5 | scanf("%lf", &first); 6 | printf("Enter second number: "); 7 | scanf("%lf", &second); 8 | 9 | // Value of first is assigned to temp 10 | temp = first; 11 | 12 | // Value of second is assigned to first 13 | first = second; 14 | 15 | // Value of temp (initial value of first) is assigned to second 16 | second = temp; 17 | 18 | printf("\nAfter swapping, firstNumber = %.2lf\n", first); 19 | printf("After swapping, secondNumber = %.2lf", second); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Swapping two Numbers: -------------------------------------------------------------------------------- 1 | Swapping two Numbers using a Temporary Variable 2 | 3 | #include 4 | #include 5 | 6 | void main() 7 | { 8 | int x = 10, y = 15, temp; 9 | temp = x; 10 | x = y; 11 | y = temp; 12 | printf("x = %d and y = %d", x, y); 13 | getch(); 14 | } 15 | -------------------------------------------------------------------------------- /Table: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | main() 4 | { 5 | int n,end,i,mul; 6 | printf("enter the number for which you want table:\n"); 7 | scanf("%d",&n); 8 | printf("enter the number till where \nyou want multiplication with %d :\n",n); 9 | scanf("%d",&end); 10 | printf("table of %d\n",n); 11 | for(i=1;i<=end;i++) 12 | { 13 | mul=n*i; 14 | printf("%d X %d = %d\n",n,i,mul); 15 | } 16 | getch(); 17 | } 18 | -------------------------------------------------------------------------------- /To Print a Rombus star pattern: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n; 6 | printf("Enter the number of rows"); 7 | scanf("%d",&n); 8 | for(int i=n;i>=1;i--) 9 | { 10 | for(int j=1;j<=i-1;j++) 11 | { 12 | printf(" "); 13 | } 14 | for(int k=1;k<=n;k++) 15 | { 16 | printf("*"); 17 | } 18 | printf("\n"); 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Tower of Hanoi: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | // C recursive function to solve tower of hanoi puzzle 5 | 6 | void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) 7 | { 8 | 9 | if (n == 1) 10 | 11 | { 12 | 13 | printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod); 14 | 15 | return; 16 | 17 | } 18 | 19 | towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 20 | 21 | printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod); 22 | 23 | towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 24 | } 25 | 26 | 27 | 28 | int main() 29 | { 30 | 31 | int n = 4; // Number of disks 32 | 33 | towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods 34 | 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /TowerOfHanoi: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) 5 | { 6 | 7 | if (n == 1) 8 | 9 | { 10 | 11 | printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod); 12 | 13 | return; 14 | 15 | } 16 | 17 | towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 18 | 19 | printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod); 20 | 21 | towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 22 | } 23 | 24 | 25 | 26 | int main() 27 | { 28 | 29 | int n = 4; // Number of disks 30 | 31 | towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods 32 | 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Triplet of three numbers (a,b,c): -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | 5 | void main() 6 | 7 | { 8 | 9 | float arr[4]; 10 | 11 | 12 | 13 | for(int i=0; i<3; i++) 14 | 15 | scanf("%f",&arr[i]); 16 | 17 | 18 | 19 | //To check wether the triplet is strictly increasing or decreasing or none. 20 | 21 | 22 | 23 | if(arr[0]>arr[1]&&arr[1]>arr[2]) 24 | 25 | printf("1"); 26 | 27 | else if(arr[2]>arr[1]&&arr[1]>arr[0]) 28 | 29 | printf("1"); 30 | 31 | else 32 | 33 | printf("0"); 34 | 35 | } 36 | -------------------------------------------------------------------------------- /Window Sliding Technique: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int maxSum(int arr[], int n, int k) 4 | { 5 | int max_sum = INT_MIN; 6 | for (int i = 0; i < n - k + 1; i++) { 7 | int current_sum = 0; 8 | for (int j = 0; j < k; j++) 9 | current_sum = current_sum + arr[i + j]; 10 | max_sum = max(current_sum, max_sum); 11 | } 12 | 13 | return max_sum; 14 | } 15 | int main() 16 | { 17 | int arr[] = { 1, 4, 2, 10, 2, 3, 1, 0, 20 }; 18 | int k = 4; 19 | int n = sizeof(arr) / sizeof(arr[0]); 20 | cout << maxSum(arr, n, k); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Winshree: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /add multiply divide and substract: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int first, second, add, subtract, multiply; 5 | float divide; 6 | 7 | printf("Enter two integers\n"); 8 | scanf("%d%d", &first, &second); 9 | 10 | add = first + second; 11 | subtract = first - second; 12 | multiply = first * second; 13 | divide = first / (float)second; //typecasting 14 | 15 | printf("Sum = %d\n", add); 16 | printf("Difference = %d\n", subtract); 17 | printf("Multiplication = %d\n", multiply); 18 | printf("Division = %.2f\n", divide); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /add two numbers in c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /addition: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /addition and subtraction: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int a,b; 4 | 5 | printf("\tEnter two integers :"); 6 | 7 | scanf("%d%d", &a,&b); 8 | 9 | printf("\nSum of these two numbers are %d", a+b); 10 | 11 | printf("\nDiff of these two no. are %d", a-b); 12 | 13 | } 14 | return0; 15 | -------------------------------------------------------------------------------- /addition no: -------------------------------------------------------------------------------- 1 | int main() { int x, y, z; 2 | printf("Enter two numbers to add\n"); scanf("%d%d", &x, &y); 3 | printf("Sum of the numbers = %d\n", z); 4 | -------------------------------------------------------------------------------- /addition of two number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /additionoftwonumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /addnos: -------------------------------------------------------------------------------- 1 | Program to Add two numbers in C 2 | 3 | #include 4 | int main() 5 | { 6 | int number1, number2, sum; 7 | printf("Enter two integers: "); 8 | scanf("%d %d", &number1, &number2); 9 | sum = number1 + number2; 10 | printf("%d + %d = %d", number1, number2, sum); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /addoftwono: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a, b, sum; 5 | 6 | printf("\nEnter two no: "); 7 | scanf("%d %d", &a, &b); 8 | 9 | sum = a + b; 10 | 11 | printf("Sum : %d", sum); 12 | 13 | return(0); 14 | } 15 | -------------------------------------------------------------------------------- /addtwodistance.c: -------------------------------------------------------------------------------- 1 | // Program to add two distances (feet-inch) 2 | #include 3 | struct Distance 4 | { 5 | int feet; 6 | float inch; 7 | } dist1, dist2, sum; 8 | 9 | int main() 10 | { 11 | printf("1st distance\n"); 12 | printf("Enter feet: "); 13 | scanf("%d", &dist1.feet); 14 | 15 | printf("Enter inch: "); 16 | scanf("%f", &dist1.inch); 17 | printf("2nd distance\n"); 18 | 19 | printf("Enter feet: "); 20 | scanf("%d", &dist2.feet); 21 | 22 | printf("Enter inch: "); 23 | scanf("%f", &dist2.inch); 24 | 25 | // adding feet 26 | sum.feet = dist1.feet + dist2.feet; 27 | // adding inches 28 | sum.inch = dist1.inch + dist2.inch; 29 | 30 | // changing to feet if inch is greater than 12 31 | while (sum.inch >= 12) 32 | { 33 | ++sum.feet; 34 | sum.inch = sum.inch - 12; 35 | } 36 | 37 | printf("Sum of distances = %d\'-%.1f\"", sum.feet, sum.inch); 38 | return 0; 39 | -------------------------------------------------------------------------------- /algorithm for finding height of a binary tree: -------------------------------------------------------------------------------- 1 | FindHeight( Node root) 2 | If root == NULL 3 | return 0 4 | else 5 | int leftH = FindHeight ( root->left ) 6 | int rightH = FindHeight(root->right ) 7 | return max( leftH, rightH )+1 8 | -------------------------------------------------------------------------------- /armstrong: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int num,armstrong=0,reminder,n; 5 | printf("enter the number"); 6 | scanf("%d",&num); 7 | n=num; 8 | while(n>0) 9 | { 10 | reminder=n%10; 11 | armstrong=armstrong +(reminder*reminder*reminder); 12 | n=n/10; 13 | } 14 | if(num==armstrong) 15 | printf("%d is armstrong number",num); 16 | else 17 | printf("%d is not armstrong number",num); 18 | } 19 | -------------------------------------------------------------------------------- /armstrongC: -------------------------------------------------------------------------------- 1 | int main() 2 | { 3 | int n,r,sum=0,temp; 4 | printf("enter the number="); 5 | scanf("%d",&n); 6 | temp=n; 7 | while(n>0) 8 | { 9 | r=n%10; 10 | sum=sum+(r*r*r); 11 | n=n/10; 12 | } 13 | if(temp==sum) 14 | printf("armstrong number "); 15 | else 16 | printf("not armstrong number"); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /armstrongnum: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,r,sum=0,temp; 5 | printf("enter the number="); 6 | scanf("%d",&n); 7 | temp=n; 8 | while(n>0) 9 | { 10 | r=n%10; 11 | sum=sum+(r*r*r); 12 | n=n/10; 13 | } 14 | if(temp==sum) 15 | printf("armstrong number "); 16 | else 17 | printf("not armstrong number"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /assemblyprog: -------------------------------------------------------------------------------- 1 | #include 2 | void main() { 3 | int a = 10, b = 20, c; 4 | 5 | asm { 6 | mov ax,a 7 | mov bx,b 8 | add ax,bx 9 | mov c,ax 10 | } 11 | 12 | printf("c= %d",c); 13 | } 14 | -------------------------------------------------------------------------------- /biggernumber: -------------------------------------------------------------------------------- 1 | /* C Program to Find Largest of Two numbers */ 2 | 3 | #include 4 | 5 | int main() { 6 | int a, b; 7 | printf("Please Enter Two different values\n"); 8 | scanf("%d %d", &a, &b); 9 | 10 | if(a > b) 11 | { 12 | printf("%d is Largest\n", a); 13 | } 14 | else if (b > a) 15 | { 16 | printf("%d is Largest\n", b); 17 | } 18 | else 19 | { 20 | printf("Both are Equal\n"); 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /biggestno: -------------------------------------------------------------------------------- 1 | /* 2 | * C program to find the biggest of three numbers 3 | */ 4 | #include 5 | 6 | void main() 7 | { 8 | int num1, num2, num3; 9 | 10 | printf("Enter the values of num1, num2 and num3\n"); 11 | scanf("%d %d %d", &num1, &num2, &num3); 12 | printf("num1 = %d\tnum2 = %d\tnum3 = %d\n", num1, num2, num3); 13 | if (num1 > num2) 14 | { 15 | if (num1 > num3) 16 | { 17 | printf("num1 is the greatest among three \n"); 18 | } 19 | else 20 | { 21 | printf("num3 is the greatest among three \n"); 22 | } 23 | } 24 | else if (num2 > num3) 25 | printf("num2 is the greatest among three \n"); 26 | else 27 | printf("num3 is the greatest among three \n"); 28 | } 29 | -------------------------------------------------------------------------------- /bignumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | //Fill the code 5 | int num1, num2; 6 | scanf(“%d %d”,&num1,&num2); 7 | if(num1 > num2) 8 | { 9 | printf(“%d is greater”,num1); 10 | } 11 | else 12 | { 13 | printf(“%d is greater”,num2); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /binStack.c: -------------------------------------------------------------------------------- 1 | #include "stdio.h" 2 | #include "stdlib.h" 3 | struct xx 4 | { 5 | int data; 6 | struct xx *link; 7 | }; 8 | struct xx *sp=0,*q; 9 | main() 10 | { 11 | int n; 12 | printf("Enter a decimal number :"); 13 | scanf("%d",&n); 14 | while(n>0) 15 | { 16 | if(n==0) 17 | { 18 | sp=(struct xx *)malloc(sizeof(struct xx)); 19 | sp->data=n%2; 20 | sp->link=0; 21 | } 22 | else 23 | { 24 | q=(struct xx *)malloc(sizeof(struct xx)); 25 | q->link=sp; 26 | sp=q; 27 | sp->data=n%2; 28 | } 29 | n=n/2; 30 | } 31 | while(sp!=0) 32 | { 33 | printf("%d ",sp->data); 34 | sp=sp->link; 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /bubble sort in C: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | void swap(int *xp, int *yp) 5 | { 6 | int temp = *xp; 7 | *xp = *yp; 8 | *yp = temp; 9 | } 10 | 11 | // A function to implement bubble sort 12 | void bubbleSort(int arr[], int n) 13 | { 14 | int i, j; 15 | for (i = 0; i < n-1; i++) 16 | 17 | // Last i elements are already in place 18 | for (j = 0; j < n-i-1; j++) 19 | if (arr[j] > arr[j+1]) 20 | swap(&arr[j], &arr[j+1]); 21 | } 22 | 23 | /* Function to print an array */ 24 | void printArray(int arr[], int size) 25 | { 26 | int i; 27 | for (i=0; i < size; i++) 28 | printf("%d ", arr[i]); 29 | printf("\n"); 30 | } 31 | 32 | 33 | int main() 34 | { 35 | int arr[] = {64, 34, 25, 12, 22, 11, 90}; 36 | int n = sizeof(arr)/sizeof(arr[0]); 37 | bubbleSort(arr, n); 38 | printf("Sorted array: \n"); 39 | printArray(arr, n); 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /bubble sorting: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int count, temp, i, j, number[30]; 6 | 7 | printf("How many numbers are u going to enter?: "); 8 | scanf("%d",&count); 9 | 10 | printf("Enter %d numbers: ",count); 11 | 12 | for(i=0;i=0;i--){ 18 | for(j=0;j<=i;j++){ 19 | if(number[j]>number[j+1]){ 20 | temp=number[j]; 21 | number[j]=number[j+1]; 22 | number[j+1]=temp; 23 | } 24 | } 25 | } 26 | 27 | printf("Sorted elements: "); 28 | for(i=0;i 2 | 3 | int main(){ 4 | 5 | int count, temp, i, j, number[30]; 6 | 7 | printf("How many numbers are u going to enter?: "); 8 | scanf("%d",&count); 9 | 10 | printf("Enter %d numbers: ",count); 11 | 12 | for(i=0;i=0;i--){ 18 | for(j=0;j<=i;j++){ 19 | if(number[j]>number[j+1]){ 20 | temp=number[j]; 21 | number[j]=number[j+1]; 22 | number[j+1]=temp; 23 | } 24 | } 25 | } 26 | 27 | printf("Sorted elements: "); 28 | for(i=0;i 2 | 3 | int main() { 4 | int values[5]; 5 | 6 | printf("Enter 5 integers: "); 7 | for(int i = 0; i < 5; ++i) { 8 | scanf("%d", &values[i]); 9 | } 10 | 11 | printf("Displaying integers: "); 12 | for(int i = 0; i < 5; ++i) { 13 | printf("%d\n", values[i]); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /c program to find duplicate character in a given string: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | 7 | int i,j,len,v=1; 8 | char str[100]; 9 | 10 | printf("enter string : "); 11 | scanf("%[^\n]%c",str); 12 | 13 | len=strlen(str); 14 | 15 | printf("duplicates character found in the string are: "); 16 | for(i=0;i 2 | #include 3 | void main() 4 | { 5 | int no,factorial; 6 | int fact(int no); 7 | clrscr(); 8 | printf("Enter a number: "); 9 | scanf("%d",&no); 10 | factorial=fact(no); 11 | printf("Factorial=%d",factorial); 12 | getch(); 13 | } 14 | int fact(int no) 15 | { 16 | if(no==1) 17 | return 1; 18 | else 19 | return(no*fact(no-1)); 20 | } 21 | -------------------------------------------------------------------------------- /calculate power Optimized: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int power(int x, unsigned int y) 4 | { 5 | if (y == 0) 6 | return 1; 7 | else if (y%2 == 0) 8 | return power(x, y/2)*power(x, y/2); 9 | else 10 | return x*power(x, y/2)*power(x, y/2); 11 | } 12 | 13 | 14 | int main() 15 | { 16 | int x = 2; 17 | unsigned int y = 3; 18 | 19 | printf("%d", power(x, y)); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /calculate the salary: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char g; 6 | int yos,qual,sal=0; 7 | 8 | printf("Enter Gender, Years of Service and Qualifications (0=Graduate, 1=Post-graduate):\n"); 9 | scanf("%c%d%d",&g,&yos,&qual); 10 | 11 | if(g == 'm'&& yos >= 10 && qual == 1) 12 | sal = 15000; 13 | else if((g == 'm' && yos >=10 && qual == 0) || (g == 'm' && yos < 10 && qual == 1)) 14 | sal = 10000; 15 | else if(g == 'm' && yos < 10 && qual == 0) 16 | sal = 7000; 17 | else if(g == 'f' && yos >= 10 && qual == 1) 18 | sal = 12000; 19 | else if(g == 'f' && yos >= 10 && qual == 0) 20 | sal = 9000; 21 | else if(g == 'f' && yos < 10 && qual == 1) 22 | sal = 10000; 23 | else if(g == 'f' && yos < 10 && qual == 0) 24 | sal = 6000; 25 | 26 | printf("\nSalary of Employee = %d\n",sal); 27 | 28 | return 0; 29 | 30 | } 31 | -------------------------------------------------------------------------------- /calculator: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /celcius to farenheit: -------------------------------------------------------------------------------- 1 | /*to convert celcius to farenheit*/ 2 | #include 3 | 4 | int main(){ 5 | float celcius,farenheit; 6 | printf("enter the value of celcius:"); 7 | scanf("%f",&celcius); 8 | farenheit=(celcius*9/5)+32; 9 | printf("the temperature in farenheit is:%f",farenheit); 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /celsius to fahrenheit: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | float celsius, fahrenheit; 6 | 7 | /* Input temperature in celsius */ 8 | printf("Enter temperature in Celsius: "); 9 | scanf("%f", &celsius); 10 | 11 | /* celsius to fahrenheit conversion formula */ 12 | fahrenheit = (celsius * 9 / 5) + 32; 13 | 14 | printf("%.2f Celsius = %.2f Fahrenheit", celsius, fahrenheit); 15 | 16 | return 17 | 18 | 0; 19 | } 20 | -------------------------------------------------------------------------------- /check leap year: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | 7 | // leap year if perfectly visible by 400 8 | if (year % 400 == 0) { 9 | printf("%d is a leap year.", year); 10 | } 11 | // not a leap year if visible by 100 12 | // but not divisible by 400 13 | else if (year % 100 == 0) { 14 | printf("%d is not a leap year.", year); 15 | } 16 | // leap year if not divisible by 100 17 | // but divisible by 4 18 | else if (year % 4 == 0) { 19 | printf("%d is a leap year.", year); 20 | } 21 | // all other years are not leap year 22 | else { 23 | printf("%d is not a leap year.", year); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /check to prime no or not: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /check whether a no. is prime or not: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | if (n % i == 0) { 9 | flag = 1; 10 | break; 11 | } 12 | } 13 | 14 | if (n == 1) { 15 | printf("1 is neither prime nor composite."); 16 | } 17 | else { 18 | if (flag == 0) 19 | printf("%d is a prime number.", n); 20 | else 21 | printf("%d is not a prime number.", n); 22 | } 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /checkPalindrome: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int num, reverse_num=0, remainder,temp; 5 | printf("Enter an integer: "); 6 | scanf("%d", &num); 7 | 8 | /* Here we are generating a new number (reverse_num) 9 | * by reversing the digits of original input number 10 | */ 11 | temp=num; 12 | while(temp!=0) 13 | { 14 | remainder=temp%10; 15 | reverse_num=reverse_num*10+remainder; 16 | temp/=10; 17 | } 18 | 19 | /* If the original input number (num) is equal to 20 | * to its reverse (reverse_num) then its palindrome 21 | * else it is not. 22 | */ 23 | if(reverse_num==num) 24 | printf("%d is a palindrome number",num); 25 | else 26 | printf("%d is not a palindrome number",num); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /check_prime_number: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int loop, number; 5 | int prime = 1; 6 | 7 | printf("Enter a number"); 8 | scanf("%d", &number); 9 | 10 | if(number <= 1){ 11 | prime = 0; 12 | } 13 | else{ 14 | for(loop = 2; loop < number; loop++) { 15 | if((number % loop) == 0) { 16 | prime = 0; 17 | } 18 | } 19 | } 20 | 21 | if (prime == 1) 22 | printf("%d is prime number.", number); 23 | else 24 | printf("%d is not a prime number.", number); 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /checkpalindrome: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int num, reverse_num=0, remainder,temp; 5 | printf("Enter an integer: "); 6 | scanf("%d", &num); 7 | 8 | /* Here we are generating a new number (reverse_num) 9 | * by reversing the digits of original input number 10 | */ 11 | temp=num; 12 | while(temp!=0) 13 | { 14 | remainder=temp%10; 15 | reverse_num=reverse_num*10+remainder; 16 | temp/=10; 17 | } 18 | 19 | /* If the original input number (num) is equal to 20 | * to its reverse (reverse_num) then its palindrome 21 | * else it is not. 22 | */ 23 | if(reverse_num==num) 24 | printf("%d is a palindrome number",num); 25 | else 26 | printf("%d is not a palindrome number",num); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /classes: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | class employee 5 | { 6 | private: 7 | int a , b , c; 8 | 9 | public: 10 | int d , e; 11 | void setdata(int a1, int b1, int c1); //Declaration 12 | void getdata(){ 13 | cout<<"THe value of a is "< This will throw error as a is private 31 | lucky.d= 35; 32 | lucky.e=45; 33 | lucky.setdata(1,2,4); 34 | lucky.getdata(); 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /compond_interest: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | float principle, rate, time, CI; 7 | 8 | /* Input principle, time and rate */ 9 | printf("Enter principle (amount): "); 10 | scanf("%f", &principle); 11 | 12 | printf("Enter time: "); 13 | scanf("%f", &time); 14 | 15 | printf("Enter rate: "); 16 | scanf("%f", &rate); 17 | 18 | /* Calculate compound interest */ 19 | CI = principle* (pow((1 + rate / 100), time)); 20 | 21 | /* Print the resultant CI */ 22 | printf("Compound Interest = %f", CI); 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /concatenate str: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char s1[100] = "programming ", s2[] = "is awesome"; 4 | int length, j; 5 | 6 | // store length of s1 in the length variable 7 | length = 0; 8 | while (s1[length] != '\0') { 9 | ++length; 10 | } 11 | 12 | // concatenate s2 to s1 13 | for (j = 0; s2[j] != '\0'; ++j, ++length) { 14 | s1[length] = s2[j]; 15 | } 16 | 17 | // terminating the s1 string 18 | s1[length] = '\0'; 19 | 20 | printf("After concatenation: "); 21 | puts(s1); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /countvowels: -------------------------------------------------------------------------------- 1 | //PROGRAM TO COUNT VOWELS IN A STRING.. 2 | #include 3 | #include 4 | #include 5 | void main() 6 | { 7 | char s1[30]; 8 | int count=0,i; 9 | clrscr(); 10 | printf("Enter the sentence:"); 11 | gets(s1); 12 | for(i=0;i 2 | int main() { 3 | double n1, n2, n3; 4 | printf("Enter three different numbers: "); 5 | scanf("%lf %lf %lf", &n1, &n2, &n3); 6 | 7 | // if n1 is greater than both n2 and n3, n1 is the largest 8 | if (n1 >= n2 && n1 >= n3) 9 | printf("%.2f is the largest number.", n1); 10 | 11 | // if n2 is greater than both n1 and n3, n2 is the largest 12 | if (n2 >= n1 && n2 >= n3) 13 | printf("%.2f is the largest number.", n2); 14 | 15 | // if n3 is greater than both n1 and n2, n3 is the largest 16 | if (n3 >= n1 && n3 >= n2) 17 | printf("%.2f is the largest number.", n3); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /creatervikas: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int findSmallestElement(int arr[], int n){ 4 | /* We are assigning the first array element to 5 | * the temp variable and then we are comparing 6 | * all the array elements with the temp inside 7 | * loop and if the element is smaller than temp 8 | * then the temp value is replaced by that. This 9 | * way we always have the smallest value in temp. 10 | * Finally we are returning temp. 11 | */ 12 | int temp = arr[0]; 13 | for(int i=0; iarr[i]) { 15 | temp=arr[i]; 16 | } 17 | } 18 | return temp; 19 | } 20 | int main() { 21 | int n; 22 | cout<<"Enter the size of array: "; 23 | cin>>n; int arr[n-1]; 24 | cout<<"Enter array elements: "; 25 | for(int i=0; i>arr[i]; 27 | } 28 | int smallest = findSmallestElement(arr, n); 29 | cout<<"Smallest Element is: "< 4 | 5 | int main() 6 | { 7 | int number, cube; 8 | 9 | printf(" \n Please Enter any integer Value : "); 10 | scanf("%d", &number); 11 | 12 | cube = number * number * number; 13 | 14 | printf("\n Cube of a given number %d is = %d", number, cube); 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /datatypes: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a = 1; 5 | char b ='G'; 6 | double c = 3.14; 7 | printf("Hello World!\n"); 8 | 9 | 10 | printf("Hello! I am a character. My value is %c and " 11 | "my size is %lu byte.\n", b,sizeof(char)); 12 | 13 | 14 | printf("Hello! I am an integer. My value is %d and " 15 | "my size is %lu bytes.\n", a,sizeof(int)); 16 | 17 | 18 | printf("Hello! I am a double floating point variable." 19 | " My value is %lf and my size is %lu bytes.\n",c,sizeof(double)); 20 | 21 | 22 | printf("Bye! See you soon. :)\n"); 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /decimaltobinary: -------------------------------------------------------------------------------- 1 | // C++ program to convert a decimal 2 | // number to binary number 3 | 4 | #include 5 | using namespace std; 6 | 7 | // function to convert decimal to binary 8 | void decToBinary(int n) 9 | { 10 | // array to store binary number 11 | int binaryNum[32]; 12 | 13 | // counter for binary array 14 | int i = 0; 15 | while (n > 0) { 16 | 17 | // storing remainder in binary array 18 | binaryNum[i] = n % 2; 19 | n = n / 2; 20 | i++; 21 | } 22 | 23 | // printing binary array in reverse order 24 | for (int j = i - 1; j >= 0; j--) 25 | cout << binaryNum[j]; 26 | } 27 | 28 | // Driver program to test above function 29 | int main() 30 | { 31 | int n = 17; 32 | decToBinary(n); 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /duplicateelementsinarray: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | int arr[] = {1, 2, 3, 4, 5,6,7,2}; 7 | int length = sizeof(arr)/sizeof(arr[0]); 8 | printf("Duplicate elements in given array: \n"); 9 | //Searches for duplicate element 10 | for(int i = 0; i < length; i++) { 11 | for(int j = i + 1; j < length; j++) { 12 | if(arr[i] == arr[j]) 13 | printf("%d\n", arr[j]); 14 | } 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /even or odd number: -------------------------------------------------------------------------------- 1 | /* Program to check whether the input integer number 2 | * is even or odd using the modulus operator (%) 3 | */ 4 | #include 5 | int main() 6 | { 7 | // This variable is to store the input number 8 | int num; 9 | 10 | printf("Enter an integer: "); 11 | scanf("%d",&num); 12 | 13 | // Modulus (%) returns remainder 14 | if ( num%2 == 0 ) 15 | printf("%d is an even number", num); 16 | else 17 | printf("%d is an odd number", num); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /evenodd: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /evnodd: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /example to calculate income tax: -------------------------------------------------------------------------------- 1 | /*to calculate income tax*/ 2 | #include 3 | 4 | int main(){ 5 | float tax=0, income; 6 | printf("enter your income\n"); 7 | scanf("%f",&income); 8 | 9 | if(income>=250000 && income<=500000){ 10 | tax=tax+0.05*(income-250000); 11 | } 12 | if(income<=500000){ 13 | tax=tax+0.20*(income-500000); 14 | } 15 | printf("your net income tax to be paid is %f\n",tax); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /fabonaccisequence: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) 9 | { 10 | printf("%d, ", t1); 11 | nextTerm = t1 + t2; 12 | t1 = t2; 13 | t2 = nextTerm; 14 | } 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /factorailno: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,fact=1,number; 5 | printf("Enter a number: "); 6 | scanf("%d",&number); 7 | for(i=1;i<=number;i++){ 8 | fact=fact*i; 9 | } 10 | printf("Factorial of %d is: %d",number,fact); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /factorial: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,fact=1,number; 5 | printf("Enter a number: "); 6 | scanf("%d",&number); 7 | for(i=1;i<=number;i++){ 8 | fact=fact*i; 9 | } 10 | printf("Factorial of %d is: %d",number,fact); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /factorial by recursion: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int fact(int); 5 | 6 | int main() { 7 | int factorial, num; 8 | 9 | printf("Enter the value of num :"); 10 | scanf("%d", &num); 11 | 12 | factorial = fact(num); 13 | printf("Factorial is %d", factorial); 14 | 15 | return (0); 16 | } 17 | 18 | int fact(int n) { 19 | if (n == 0) { 20 | return (1); 21 | } 22 | return (n * fact(n - 1)); 23 | -------------------------------------------------------------------------------- /factorial number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i,fact=1,number; 5 | printf("Enter a number: "); 6 | scanf("%d",&number); 7 | for(i=1;i<=number;i++){ 8 | fact=fact*i; 9 | } 10 | printf("Factorial of %d is: %d",number,fact); 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /factorial.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i; 4 | unsigned long long fact = 1; 5 | printf("Enter an integer: "); 6 | scanf("%d", &n); 7 | 8 | // shows error if the user enters a negative integer 9 | if (n < 0) 10 | printf("Error! Factorial of a negative number doesn't exist."); 11 | else { 12 | for (i = 1; i <= n; ++i) { 13 | fact *= i; 14 | } 15 | printf("Factorial of %d = %llu", n, fact); 16 | } 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /factorial_prog: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i; 4 | unsigned long long fact = 1; 5 | printf("Enter an integer: "); 6 | scanf("%d", &n); 7 | 8 | // shows error if the user enters a negative integer 9 | if (n < 0) 10 | printf("Error! Factorial of a negative number doesn't exist."); 11 | else { 12 | for (i = 1; i <= n; ++i) { 13 | fact *= i; 14 | } 15 | printf("Factorial of %d = %llu", n, fact); 16 | } 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /factors: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num, i; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &num); 6 | printf("Factors of %d are: ", num); 7 | for (i = 1; i <= num; ++i) { 8 | if (num % i == 0) { 9 | printf("%d ", i); 10 | } 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /febonacci series: -------------------------------------------------------------------------------- 1 | # febonacci series 2 | #include 3 | int main() { 4 | int i, n, t1 = 0, t2 = 1, nextTerm; 5 | printf("Enter the number of terms: "); 6 | scanf("%d", &n); 7 | printf("Fibonacci Series: "); 8 | 9 | for (i = 1; i <= n; ++i) { 10 | printf("%d, ", t1); 11 | nextTerm = t1 + t2; 12 | t1 = t2; 13 | t2 = nextTerm; 14 | } 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /fibanocci_series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /fibonacci: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /fibonacci no.: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int fib1=0,fib2=1,fib,n; 5 | printf("enter the lmits:"); 6 | scanf("%d",&n); 7 | 8 | for(int i=1;i<=n;i++){ 9 | printf("%d\n",fib1); 10 | 11 | fib=fib1+fib2; 12 | fib1=fib2; 13 | fib2=fib; 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /fibonacci series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /fibonaci of certain number: -------------------------------------------------------------------------------- 1 | include 2 | int main() { 3 | int t1 = 0, t2 = 1, nextTerm = 0, n; 4 | printf("Enter a positive number: "); 5 | scanf("%d", &n); 6 | 7 | // displays the first two terms which is always 0 and 1 8 | printf("Fibonacci Series: %d, %d, ", t1, t2); 9 | nextTerm = t1 + t2; 10 | 11 | while (nextTerm <= n) { 12 | printf("%d, ", nextTerm); 13 | t1 = t2; 14 | t2 = nextTerm; 15 | nextTerm = t1 + t2; 16 | } 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /find gcd: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int gcd(int a, int b) 5 | { 6 | int r; 7 | while(a) 8 | { 9 | r=b%a; 10 | b=a; 11 | a=r; 12 | } 13 | return b; 14 | } 15 | int gcd_(int* A, int N) 16 | { 17 | int c=gcd(*A,*(A+1)); 18 | int i,g; 19 | for(i=1;i 2 | int main() 3 | { 4 | int num1, num2, flag_var, i, j; 5 | 6 | /* Ask user to input the from/to range 7 | * like 1 to 100, 10 to 1000 etc. 8 | */ 9 | printf("Enter two range(input integer numbers only):"); 10 | //Store the range in variables using scanf 11 | scanf("%d %d", &num1, &num2); 12 | 13 | //Display prime numbers for input range 14 | printf("Prime numbers from %d and %d are:\n", num1, num2); 15 | for(i=num1+1; i 2 | int main() { 3 | int i, n; 4 | float arr[100]; 5 | printf("Enter the number of elements (1 to 100): "); 6 | scanf("%d", &n); 7 | 8 | for (i = 0; i < n; ++i) { 9 | printf("Enter number%d: ", i + 1); 10 | scanf("%f", &arr[i]); 11 | } 12 | 13 | for (i = 1; i < n; ++i) { 14 | if (arr[0] < arr[i]) 15 | arr[0] = arr[i]; 16 | } 17 | 18 | printf("Largest element = %.2f", arr[0]); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /findingtickets: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int num_s,tickets,r; 6 | printf("please enter number of rows!!"); 7 | scanf("%d",&r); 8 | printf("please enter number of seats!!"); 9 | scanf("%d",&num_s); 10 | printf("please enter number of tickets!!"); 11 | scanf("%d",&tickets); 12 | int n=r*num_s; 13 | if(n>tickets) 14 | printf("Opps!! tickets is less then number of seats:)"); 15 | else 16 | printf("%d %d",n,tickets-n); 17 | 18 | } 19 | -------------------------------------------------------------------------------- /gcd_of_2_numbers: -------------------------------------------------------------------------------- 1 | // C program to find GCD of two numbers 2 | #include 3 | 4 | // Recursive function to return gcd of a and b 5 | int gcd(int a, int b) 6 | { 7 | // Everything divides 0 8 | if (a == 0) 9 | return b; 10 | if (b == 0) 11 | return a; 12 | 13 | // base case 14 | if (a == b) 15 | return a; 16 | 17 | // a is greater 18 | if (a > b) 19 | return gcd(a-b, b); 20 | return gcd(a, b-a); 21 | } 22 | 23 | // Driver program to test above function 24 | int main() 25 | { 26 | 27 | int a , b ; 28 | printf("Enter 2 numbers to find their gcd"); 29 | scanf("%d%d",&a,&b); 30 | printf("GCD of %d and %d is %d ", a, b, gcd(a, b)); 31 | return 0; 32 | 33 | } 34 | -------------------------------------------------------------------------------- /graterNumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a,b; 5 | printf("Enter two values); 6 | scanf("%d%d",&a,&b); 7 | if(a>b) 8 | { 9 | return(a); 10 | } 11 | else 12 | { 13 | return(b); 14 | } 15 | 16 | 17 | } 18 | -------------------------------------------------------------------------------- /greatearno: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /greatemo: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a, b; 5 | printf("Please Enter Two different values\n"); 6 | scanf("%d %d", &a, &b); 7 | 8 | if(a > b) 9 | { 10 | printf("%d is Largest\n", a); 11 | } 12 | else if (b > a) 13 | { 14 | printf("%d is Largest\n", b); 15 | } 16 | else 17 | { 18 | printf("Both are Equal\n"); 19 | } 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /greater number: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int a, b, big; 6 | printf("Enter any two number: "); 7 | scanf("%d%d", &a, &b); 8 | if(a>b) 9 | big=a; 10 | else 11 | big=b; 12 | printf("\nBiggest of the two number is: %d", big); 13 | getch(); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /greater number c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int no1, no2; 5 | printf("Insert two numbers:"); 6 | scanf("%d %d",&no1, &no2); 7 | 8 | //Condition to check which of the two number is greater 9 | //it will compare of number where number 1 is greater 10 | if(no1 > no2) 11 | printf("%d is greatest",no1); 12 | 13 | //where number 2 is greater 14 | else if(no2 > no1) 15 | printf("%d is greatest",no2); 16 | 17 | //for both are equal 18 | else 19 | printf("%d and %d are equal", no1, no2); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /greater of three numbers: -------------------------------------------------------------------------------- 1 | int main() 2 | { 3 | int num1,num2,num3; 4 | printf("\nEnter value of num1, num2 and num3:"); 5 | scanf("%d %d %d",&num1,&num2,&num3); 6 | if((num1>num2)&&(num1>num3)) 7 | printf("\n Number1 is greatest"); 8 | else if((num2>num3)&&(num2>num1)) 9 | printf("\n Number2 is greatest"); 10 | else 11 | printf("\n Number3 is greatest"); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /greater of two number: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int a, b, big; 6 | printf("Enter any two number: "); 7 | scanf("%d%d", &a, &b); 8 | if(a>b) 9 | big=a; 10 | else 11 | big=b; 12 | printf("\nBiggest of the two number is: %d", big); 13 | getch(); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /greater_two_number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | 5 | int num1, num2; 6 | scanf(“%d %d”,&num1,&num2); 7 | if(num1 > num2) 8 | { 9 | printf(“%d is greater”,num1); 10 | } 11 | else 12 | { 13 | printf(“%d is greater”,num2); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /greaterno: -------------------------------------------------------------------------------- 1 | /* C Program to Find Largest of Two numbers */ 2 | 3 | #include 4 | 5 | int main() { 6 | int a, b; 7 | printf("Please Enter Two different values\n"); 8 | scanf("%d %d", &a, &b); 9 | 10 | if(a > b) 11 | { 12 | printf("%d is Largest\n", a); 13 | } 14 | else if (b > a) 15 | { 16 | printf("%d is Largest\n", b); 17 | } 18 | else 19 | { 20 | printf("Both are Equal\n"); 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /greaterno.: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | //Fill the code 5 | int num1, num2; 6 | scanf(“%d %d”,&num1,&num2); 7 | if(num1 > num2) 8 | { 9 | printf(“%d is greater”,num1); 10 | } 11 | else 12 | { 13 | printf(“%d is greater”,num2); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /greaterno10: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int a[10]; 4 | int i; 5 | int greatest; 6 | printf("Enter ten values:"); 7 | //Store 10 numbers in an array 8 | for (i = 0; i < 10; i++) { 9 | scanf("%d", &a[i]); 10 | } 11 | //Assume that a[0] is greatest 12 | greatest = a[0]; 13 | for (i = 0; i < 10; i++) { 14 | if (a[i] > greatest) { 15 | greatest = a[i]; 16 | } 17 | } 18 | printf(" 19 | Greatest of ten numbers is %d", greatest 20 | } 21 | -------------------------------------------------------------------------------- /greaternoofthree: -------------------------------------------------------------------------------- 1 | void main() 2 | { 3 | int num1, num2, num3; 4 | 5 | printf("Enter the values of num1, num2 and num3\n"); 6 | scanf("%d %d %d", &num1, &num2, &num3); 7 | printf("num1 = %d\tnum2 = %d\tnum3 = %d\n", num1, num2, num3); 8 | if (num1 > num2) 9 | { 10 | if (num1 > num3) 11 | { 12 | printf("num1 is the greatest among three \n"); 13 | } 14 | else 15 | { 16 | printf("num3 is the greatest among three \n"); 17 | } 18 | } 19 | else if (num2 > num3) 20 | printf("num2 is the greatest among three \n"); 21 | else 22 | printf("num3 is the greatest among three \n"); 23 | } 24 | -------------------------------------------------------------------------------- /greaternumber: -------------------------------------------------------------------------------- 1 | /* 2 | * C program to find the biggest of three numbers 3 | */ 4 | #include 5 | 6 | void main() 7 | { 8 | int num1, num2, num3; 9 | 10 | printf("Enter the values of num1, num2 and num3\n"); 11 | scanf("%d %d %d", &num1, &num2, &num3); 12 | printf("num1 = %d\tnum2 = %d\tnum3 = %d\n", num1, num2, num3); 13 | if (num1 > num2) 14 | { 15 | if (num1 > num3) 16 | { 17 | printf("num1 is the greatest among three \n"); 18 | } 19 | else 20 | { 21 | printf("num3 is the greatest among three \n"); 22 | } 23 | } 24 | else if (num2 > num3) 25 | printf("num2 is the greatest among three \n"); 26 | else 27 | printf("num3 is the greatest among three \n"); 28 | } 29 | -------------------------------------------------------------------------------- /greaternumberofAorB: -------------------------------------------------------------------------------- 1 | // C program to find the greatest of three numbers 2 | 3 | #include 4 | int main() 5 | { 6 | //Fill the code 7 | int num1, num2, num3; 8 | scanf(“%d %d %d”,&num1,&num2,&num3); 9 | if(num1 > num2 && num1 > num3) 10 | { 11 | printf(“%d is greater”,num1); 12 | } 13 | else if(num2 > num1 && num2 > num3) 14 | { 15 | printf(“%d is greater”,num2); 16 | } 17 | else 18 | { 19 | printf(“%d is greater”,num3); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /greatertwonumber: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int a,b; 6 | clrscr(); 7 | scanf("%d %d",&a,&b); 8 | if(a>b) 9 | { 10 | printf("a is greater number %d",a); 11 | } 12 | else 13 | { 14 | printf("b is greater number % d",b); 15 | } 16 | getch(); 17 | } 18 | -------------------------------------------------------------------------------- /greatest number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double n1, n2, n3; 4 | printf("Enter three different numbers: "); 5 | scanf("%lf %lf %lf", &n1, &n2, &n3); 6 | 7 | // if n1 is greater than both n2 and n3, n1 is the largest 8 | if (n1 >= n2 && n1 >= n3) 9 | printf("%.2f is the largest number.", n1); 10 | 11 | // if n2 is greater than both n1 and n3, n2 is the largest 12 | if (n2 >= n1 && n2 >= n3) 13 | printf("%.2f is the largest number.", n2); 14 | 15 | // if n3 is greater than both n1 and n2, n3 is the largest 16 | if (n3 >= n1 && n3 >= n2) 17 | printf("%.2f is the largest number.", n3); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /greatest number 1: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | 6 | int n1,n2,sum; 7 | clrscr(); 8 | 9 | printf("\nEnter 1st number : "); 10 | scanf("%d",&n1); 11 | 12 | printf("\nEnter 2nd number : "); 13 | scanf("%d",&n2); 14 | 15 | if(n1 > n2) 16 | printf("\n1st number is greatest."); 17 | else 18 | printf("\n2nd number is greatest."); 19 | 20 | getch(); 21 | } 22 | 23 | Output : 24 | 25 | Enter 1st number : 115 26 | Enter 2nd number : 228 27 | 2nd number is greatest. 28 | -------------------------------------------------------------------------------- /greatestoftwonumbers: -------------------------------------------------------------------------------- 1 | // C program to find largest of three numbers in C using nested if 2 | #include 3 | int main() 4 | { 5 | int a,b,c; 6 | printf("Enter three numbers : "); 7 | scanf("%d %d %d", &a,&b,&c); 8 | int max = 0; 9 | if(a > b && a > c) 10 | printf("\nThe largest among the three numbers is %d",a); 11 | else if(b > a && b > c) 12 | printf("\nThe largest among the three numbers is %d",b); 13 | else 14 | printf("\nThe largest among the three numbers is %d",c); 15 | printf("\n"); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /greatmo: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double n1, n2, n3; 4 | printf("Enter three different numbers: "); 5 | scanf("%lf %lf %lf", &n1, &n2, &n3); 6 | 7 | // if n1 is greater than both n2 and n3, n1 is the largest 8 | if (n1 >= n2 && n1 >= n3) 9 | printf("%.2f is the largest number.", n1); 10 | 11 | // if n2 is greater than both n1 and n3, n2 is the largest 12 | if (n2 >= n1 && n2 >= n3) 13 | printf("%.2f is the largest number.", n2); 14 | 15 | // if n3 is greater than both n1 and n2, n3 is the largest 16 | if (n3 >= n1 && n3 >= n2) 17 | printf("%.2f is the largest number.", n3); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /greatno: -------------------------------------------------------------------------------- 1 | int main() 2 | { 3 | //Fill the code 4 | int num1, num2; 5 | scanf(“%d %d”,&num1,&num2); 6 | if(num1 > num2) 7 | { 8 | printf(“%d is greater”,num1); 9 | } 10 | else 11 | { 12 | printf(“%d is greater”,num2); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /greatorno: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int num1,num2,num3; 5 | 6 | //Ask user to input any three integer numbers 7 | printf("\nEnter value of num1, num2 and num3:"); 8 | //Store input values in variables for comparsion 9 | scanf("%d %d %d",&num1,&num2,&num3); 10 | 11 | if((num1>num2)&&(num1>num3)) 12 | printf("\n Number1 is greatest"); 13 | else if((num2>num3)&&(num2>num1)) 14 | printf("\n Number2 is greatest"); 15 | else 16 | printf("\n Number3 is greatest"); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /greternumber: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | 5 | int main(void) 6 | 7 | { 8 | 9 | 10 | int num1,num2; 11 | 12 | printf("Enter two numbers:"); 13 | scanf("%d %d",&num1,&num2); 14 | 15 | 16 | if(num1>num2) 17 | 18 | 19 | { 20 | 21 | printf("%d is greatest",num1); 22 | 23 | 24 | } 25 | 26 | 27 | else if(num2>num1) 28 | 29 | 30 | { 31 | 32 | 33 | printf("%d is greatest",num2); 34 | 35 | 36 | } 37 | 38 | 39 | else 40 | 41 | 42 | { 43 | 44 | 45 | printf("%d and %d are equal",num1,num2); 46 | 47 | 48 | } 49 | 50 | 51 | return 0; 52 | 53 | 54 | } 55 | -------------------------------------------------------------------------------- /gretest: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | 6 | int n1,n2,sum; 7 | clrscr(); 8 | 9 | printf("\nEnter 1st number : "); 10 | scanf("%d",&n1); 11 | 12 | printf("\nEnter 2nd number : "); 13 | scanf("%d",&n2); 14 | 15 | if(n1 > n2) 16 | printf("\n1st number is greatest."); 17 | else 18 | printf("\n2nd number is greatest."); 19 | 20 | getch(); 21 | } 22 | -------------------------------------------------------------------------------- /gretter new: -------------------------------------------------------------------------------- 1 | / C program to find the greatest of two numbers 2 | 3 | #include 4 | int main() 5 | { 6 | //Fill the code 7 | int num1, num2; 8 | scanf(“%d %d”,&num1,&num2); 9 | if(num1 > num2) 10 | { 11 | printf(“%d is greater”,num1); 12 | } 13 | else 14 | { 15 | printf(“%d is greater”,num2); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /hacktoberfest: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | printf("Hacktober fest is going on!!"); 6 | } 7 | -------------------------------------------------------------------------------- /hash_on_eightbitnumber.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char ch, input[9], s[9]; 5 | int i, len=0; 6 | 7 | printf("Enter your input bits:"); 8 | scanf("%s",input); 9 | 10 | printf("Enter your key S (8 bits):"); 11 | scanf("%s",s); 12 | 13 | printf("Your hash code is:"); 14 | for(i=0; i<8; i++) 15 | { 16 | ch=input[i]^s[i]; 17 | printf("%d",ch); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /helloc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | printf("Hello c ! Have a nice day:)"); 6 | } 7 | -------------------------------------------------------------------------------- /int, float, double and char: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int intType; 4 | float floatType; 5 | double doubleType; 6 | char charType; 7 | 8 | // sizeof evaluates the size of a variable 9 | printf("Size of int: %ld bytes\n", sizeof(intType)); 10 | printf("Size of float: %ld bytes\n", sizeof(floatType)); 11 | printf("Size of double: %ld bytes\n", sizeof(doubleType)); 12 | printf("Size of char: %ld byte\n", sizeof(charType)); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /interest.c: -------------------------------------------------------------------------------- 1 | /** 2 | * C program to calculate simple interest 3 | */ 4 | 5 | #include 6 | 7 | int main() 8 | { 9 | float principle, time, rate, SI; 10 | 11 | /* Input principle, rate and time */ 12 | printf("Enter principle (amount): "); 13 | scanf("%f", &principle); 14 | 15 | printf("Enter time: "); 16 | scanf("%f", &time); 17 | 18 | printf("Enter rate: "); 19 | scanf("%f", &rate); 20 | 21 | /* Calculate simple interest */ 22 | SI = (principle * time * rate) / 100; 23 | 24 | /* Print the resultant value of SI */ 25 | printf("Simple Interest = %f", SI); 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /intrest: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | 7 | float n,r,p,a,result; 8 | int i; 9 | cout<<"enter the value of the r , n & p"<>r>>n>>p; 11 | a=r+1; 12 | for ( i = 1; i==(int)n-1; i++) 13 | { 14 | /* code */ 15 | a=a*(1+r); 16 | } 17 | result=a*p; 18 | cout<<"the result is : "< 2 | int main() 3 | { 4 | int n1, n2; 5 | scanf(“%d %d”,&n1,&n2); 6 | if(n1 > n2) 7 | { 8 | printf(“%d is larger”,n1); 9 | } 10 | else 11 | { 12 | printf(“%d is larger”,n2); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /leapYear: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | 7 | if (year % 400 == 0) { 8 | printf("%d is a leap year.", year); 9 | } 10 | else if (year % 100 == 0) { 11 | printf("%d is not a leap year.", year); 12 | } 13 | else if (year % 4 == 0) { 14 | printf("%d is a leap year.", year); 15 | } 16 | else { 17 | printf("%d is not a leap year.", year); 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /leapyear.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | if (year % 400 == 0) { 7 | printf("%d is a leap year.", year); 8 | } 9 | else if (year % 100 == 0) { 10 | printf("%d is not a leap year.", year); 11 | } 12 | else if (year % 4 == 0) { 13 | printf("%d is a leap year.", year); 14 | } 15 | else { 16 | printf("%d is not a leap year.", year); 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /m%n remainder 1.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | 5 | void main() 6 | 7 | { 8 | 9 | int m,n; 10 | 11 | scanf("%d",&m); 12 | 13 | scanf("%d",&n); 14 | 15 | 16 | 17 | int rem = m%n; //% is used to find the remainder. 18 | 19 | 20 | 21 | if(rem==1) 22 | 23 | printf("1"); 24 | 25 | else 26 | 27 | printf("0"); 28 | 29 | 30 | 31 | } 32 | -------------------------------------------------------------------------------- /mapOfIndia: -------------------------------------------------------------------------------- 1 | main() 2 | { 3 | int a,b,c; 4 | int count = 1; 5 | 6 | for (b = c = 10; 7 | a = "- FIGURE?, UMKC,XYZHello Folks,\ 8 | TFy!QJu ROo TNn(ROo)SLq SLq ULo+\ 9 | UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\ 10 | NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\ 11 | HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\ 12 | T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\ 13 | Hq!WFs XDt!"[b+++21]; ) 14 | for(; a-- > 64 ; ) 15 | putchar ( ++c=='Z' ? c = c/ 9:33^b&1); 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /maxinarray: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | #define SIZE 50 //Defining max size of array 6 | 7 | int main() 8 | 9 | { 10 | int array[SIZE]; 11 | int i, max, min, size; 12 | // Input size of the array 13 | cout<<"Enter size of the array: "; 14 | cin>>size; 15 | // Input array elements 16 | cout<<"\n Enter "<>array[i]; 19 | // Assume first element as maximum 20 | max = array[0]; 21 | 22 | //Find maximum in all array elements. 23 | for(i=1; i max) 27 | max = array[i]; 28 | 29 | } 30 | // Print maximum element 31 | cout<<"\nMaximum element =" << max << "\n"; 32 | 33 | return 0; 34 | 35 | } 36 | -------------------------------------------------------------------------------- /mergetwosortedarrays: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | 5 | void mergeArrays(int arr1[], int arr2[], int n1, 6 | int n2, int arr3[]) 7 | { 8 | int i = 0, j = 0, k = 0; 9 | while (i>n1>>n2; 25 | int arr1[n1],arr2[n2]; 26 | for(int i=0;i>arr1[i]; 28 | } 29 | for(int i=0;i>arr2[i]; 31 | } 32 | 33 | int arr3[n1+n2]; 34 | mergeArrays(arr1, arr2, n1, n2, arr3); 35 | 36 | cout << "Array after merging into one" < 2 | using namespace std; 3 | 4 | void findMultiples(int n){ 5 | for(int i = 0; i <= n; i++) 6 | if(i % 3 == 0 && i % 5 == 0) 7 | cout << i << endl; 8 | } 9 | 10 | int main() { 11 | findMultiples(120); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /multiplication: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int one, two, multiply; 6 | printf("Enter first number - "); 7 | scanf("%d",&one); 8 | printf("Enter second number - "); 9 | scanf("%d",&two); 10 | multiply = one * two; 11 | printf("The multiplication of numbers %d and %d is %d",one,two,multiply); 12 | getch(); 13 | } 14 | -------------------------------------------------------------------------------- /multiplication of 2.12 and 3.88: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | float A, B, product = 0.0f; 6 | 7 | // Ask user to enter the two numbers 8 | printf("Enter two floating numbers A and B : \n"); 9 | 10 | // Read two numbers from the user || A = 2.12, B = 3.88 11 | scanf("%f%f", &A, &B); 12 | 13 | // Calclulate the multiplication of A and B 14 | // using '*' operator 15 | product = A * B; 16 | 17 | // Print the product 18 | printf("Product of A and B is: %f", product); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /multiplication_table: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i; 4 | printf("Enter an integer: "); 5 | scanf("%d", &n); 6 | for (i = 1; i <= 10; ++i) { 7 | printf("%d * %d = %d \n", n, i, n * i); 8 | } 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /multiply: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double a, b, product; 4 | printf("Enter two numbers: "); 5 | scanf("%lf %lf", &a, &b); 6 | 7 | // Calculating product 8 | product = a * b; 9 | 10 | // Result up to 2 decimal point is displayed using %.2lf 11 | printf("Product = %.2lf", product); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /multiply two no.: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int one, two, multiply; 6 | printf("Enter first number - "); 7 | scanf("%d",&one); 8 | printf("Enter second number - "); 9 | scanf("%d",&two); 10 | multiply = one * two; 11 | printf("The multiplication of numbers %d and %d is %d",one,two,multiply); 12 | getch(); 13 | } 14 | -------------------------------------------------------------------------------- /multiplyoftwono: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double a, b, product; 4 | printf("Enter two numbers: "); 5 | scanf("%lf %lf", &a, &b); 6 | 7 | // Calculating product 8 | product = a * b; 9 | 10 | // Result up to 2 decimal point is displayed using %.2lf 11 | printf("Product = %.2lf", product); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /negativeNumber.c: -------------------------------------------------------------------------------- 1 | // Program to display a number if it is negative 2 | 3 | #include 4 | int main() { 5 | int number; 6 | 7 | printf("Enter an integer: "); 8 | scanf("%d", &number); 9 | 10 | // true if number is less than 0 11 | if (number < 0) { 12 | printf("You entered %d.\n", number); 13 | } 14 | 15 | printf("The if statement is easy."); 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /no of digits in number: -------------------------------------------------------------------------------- 1 | /* C Program to Count Number of Digits in a Number using While Loop */ 2 | #include 3 | 4 | int main() 5 | { 6 | int Number, Reminder, Count=0; 7 | 8 | printf("\n Please Enter any number\n"); 9 | scanf("%d", &Number); 10 | 11 | while(Number > 0) 12 | { 13 | Number = Number / 10; 14 | Count = Count + 1; 15 | } 16 | 17 | printf("\n Number of Digits in a Given Number = %d", Count); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /numberSwap: -------------------------------------------------------------------------------- 1 | //Forswaping two numbers. 2 | #include 3 | 4 | int main() 5 | { 6 | int x, y; 7 | printf("Enter Value of x "); 8 | scanf("%d", &x); 9 | printf("\nEnter Value of y "); 10 | scanf("%d", &y); 11 | 12 | int temp = x; 13 | x = y; 14 | y = temp; 15 | 16 | printf("\nAfter Swapping: x = %d, y = %d", x, y); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /odd number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num; 4 | printf("Enter an integer: "); 5 | scanf("%d", &num); 6 | 7 | // True if num is perfectly divisible by 2 8 | if(num % 2 == 0) 9 | printf("%d is even.", num); 10 | else 11 | printf("%d is odd.", num); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /odd or enen: -------------------------------------------------------------------------------- 1 | #include 2 | int main () 3 | { 4 | int n; 5 | printf("enter the value of n\n"); 6 | scanf("%d",&n); 7 | if (n%d==0): 8 | { 9 | printf("%d is enen ,n); 10 | } 11 | else 12 | { 13 | printf("%d is odd ,n); 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /optimized implementation of bubble sort: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int array[100], n, i, j, swap,flag=0; 5 | printf("Enter number of elementsn"); 6 | scanf("%d", &n); 7 | printf("Enter %d Numbers:n", n); 8 | for(i = 0; i < n; i++) 9 | scanf("%d", &array[i]); 10 | for(i = 0 ; i < n - 1; i++) 11 | { 12 | for(j = 0 ; j < n-i-1; j++) 13 | { 14 | if(array[j] > array[j+1]) 15 | { 16 | swap = array[j]; 17 | array[j] = array[j+1]; 18 | array[j+1] = swap; 19 | flag=1; 20 | } 21 | if(!flag) 22 | { 23 | break; 24 | } 25 | } 26 | } 27 | printf("Sorted Array:n"); 28 | for(i = 0; i < n; i++) 29 | printf("%dn", array[i]); 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /orphanprocess.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | // fork() Create a child process 8 | 9 | int pid = fork(); 10 | if (pid > 0) 11 | { 12 | //getpid() returns process id 13 | // while getppid() will return parent process id 14 | printf("Parent process\n"); 15 | printf("ID : %d\n\n",getpid()); 16 | } 17 | else if (pid == 0) 18 | { 19 | printf("Child process\n"); 20 | // getpid() will return process id of child process 21 | printf("ID: %d\n",getpid()); 22 | // getppid() will return parent process id of child process 23 | printf("Parent -ID: %d\n\n",getppid()); 24 | 25 | sleep(10); 26 | 27 | // At this time parent process has finished. 28 | // So if u will check parent process id 29 | // it will show different process id 30 | printf("\nChild process \n"); 31 | printf("ID: %d\n",getpid()); 32 | printf("Parent -ID: %d\n",getppid()); 33 | } 34 | else 35 | { 36 | printf("Failed to create child process"); 37 | } 38 | 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /p for calculator: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | char operator; 4 | double first, second; 5 | printf("Enter an operator (+, -, *,): "); 6 | scanf("%c", &operator); 7 | printf("Enter two operands: "); 8 | scanf("%lf %lf", &first, &second); 9 | 10 | switch (operator) { 11 | case '+': 12 | printf("%.1lf + %.1lf = %.1lf", first, second, first + second); 13 | break; 14 | case '-': 15 | printf("%.1lf - %.1lf = %.1lf", first, second, first - second); 16 | break; 17 | case '*': 18 | printf("%.1lf * %.1lf = %.1lf", first, second, first * second); 19 | break; 20 | case '/': 21 | printf("%.1lf / %.1lf = %.1lf", first, second, first / second); 22 | break; 23 | // operator doesn't match any case constant 24 | default: 25 | printf("Error! operator is not correct"); 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /palindrom: -------------------------------------------------------------------------------- 1 | #include 2 | void main() 3 | { 4 | int num,n,reverce=0,reminder; 5 | printf("enter the number"); 6 | scanf("%d",&num); 7 | n=num; 8 | while(n>0) 9 | { 10 | reminder=n%10; 11 | reverce=(reverce*10)+reminder; 12 | n=n/10; 13 | } 14 | if(num==reverce) 15 | printf("palindrom"); 16 | else 17 | printf("not palindrome"); 18 | } 19 | -------------------------------------------------------------------------------- /palindrome: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | // A function to check if a string str is palindrome 5 | void isPalindrome(char str[]) 6 | { 7 | // Start from leftmost and rightmost corners of str 8 | int l = 0; 9 | int h = strlen(str) - 1; 10 | 11 | // Keep comparing characters while they are same 12 | while (h > l) 13 | { 14 | if (str[l++] != str[h--]) 15 | { 16 | printf("%s is Not Palindrome", str); 17 | return; 18 | } 19 | } 20 | printf("%s is palindrome", str); 21 | } 22 | 23 | // Driver program to test above function 24 | int main() 25 | { 26 | isPalindrome("abba"); 27 | isPalindrome("abbccbba"); 28 | isPalindrome("geeks"); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /palindrome using while loop: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int Number, Temp, Reminder, Reverse = 0; 6 | 7 | printf("\nPlease Enter any number to Check for Palindrome\n"); 8 | scanf("%d", &Number); 9 | 10 | //Helps to prevent altering the original value 11 | Temp = Number; 12 | 13 | while ( Temp > 0) 14 | { 15 | Reminder = Temp %10; 16 | Reverse = Reverse *10+ Reminder; 17 | Temp = Temp /10; 18 | } 19 | 20 | printf("Reverse of entered number is = %d\n", Reverse); 21 | 22 | if ( Number == Reverse ) 23 | printf("\n%d is Palindrome Number.\n", Number); 24 | 25 | else 26 | printf("%d is not the Palindrome Number.\n", Number); 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /palindromecheck: -------------------------------------------------------------------------------- 1 | int main() 2 | { 3 | int n,r,sum=0,temp; 4 | printf("enter the number="); 5 | scanf("%d",&n); 6 | temp=n; 7 | while(n>0) 8 | { 9 | r=n%10; 10 | sum=(sum*10)+r; 11 | n=n/10; 12 | } 13 | if(temp==sum) 14 | printf("palindrome number "); 15 | else 16 | printf("not palindrome"); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /pascaltriangle: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | int main() { 4 | int rows, coef = 1, space, i, j; 5 | printf("Enter the number of rows: "); 6 | scanf("%d", &rows); 7 | for (i = 0; i < rows; i++) { 8 | for (space = 1; space <= rows - i; space++) 9 | printf(" "); 10 | for (j = 0; j <= i; j++) { 11 | if (j == 0 || i == 0) 12 | coef = 1; 13 | else 14 | coef = coef * (i - j + 1) / j; 15 | printf("%4d", coef); 16 | } 17 | printf("\n"); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /passing address: -------------------------------------------------------------------------------- 1 | #include 2 | void swap(int *n1, int *n2); 3 | 4 | int main() 5 | { 6 | int num1 = 5, num2 = 10; 7 | 8 | // address of num1 and num2 is passed 9 | swap( &num1, &num2); 10 | 11 | printf("num1 = %d\n", num1); 12 | printf("num2 = %d", num2); 13 | return 0; 14 | } 15 | 16 | void swap(int* n1, int* n2) 17 | { 18 | int temp; 19 | temp = *n1; 20 | *n1 = *n2; 21 | *n2 = temp; 22 | } 23 | -------------------------------------------------------------------------------- /pattern programs: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { int i,j,n; 5 | printf("enter n= "); 6 | scanf("%d",&n); 7 | for(i=1;i<=n;i++) 8 | { 9 | for(j=1;j<=n;j++) 10 | {if(i==j) 11 | printf("\\"); 12 | else if(i+j==n+1) 13 | printf("/"); 14 | else printf("*"); 15 | } 16 | printf("\n"); 17 | 18 | }} 19 | -------------------------------------------------------------------------------- /pattern1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int n, x, y, k; 6 | printf("Enter the number of rows to show number pattern: "); 7 | scanf("%d",&n); 8 | for(x =1; x <= n; x++) 9 | { 10 | for(y =1; y <= n; y++) 11 | { 12 | if(y <= x) 13 | printf("%d",y); 14 | else 15 | printf(" "); 16 | } 17 | for(y = n; y >= 1;y--) 18 | { 19 | if(y <= x) 20 | printf("%d",y); 21 | else 22 | printf(" "); 23 | } 24 | printf("\n"); 25 | } 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /pelindromeno: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n,r,sum=0,temp; 5 | printf("enter the number="); 6 | scanf("%d",&n); 7 | temp=n; 8 | while(n>0) 9 | { 10 | r=n%10; 11 | sum=(sum*10)+r; 12 | n=n/10; 13 | } 14 | if(temp==sum) 15 | printf("palindrome number "); 16 | else 17 | printf("not palindrome"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /polynomial_equation_solver: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | float poly(float a[], int, float); 5 | 6 | int main() 7 | { 8 | float x, a[10], y1; 9 | int deg, i; 10 | 11 | printf("Enter the degree of polynomial equation: "); 12 | scanf("%d", °); 13 | 14 | printf("Ehter the value of x for which the equation is to be evaluated: "); 15 | scanf("%f", &x); 16 | 17 | for(i=0; i<=deg; i++) 18 | { 19 | printf("Enter the coefficient of x to the power %d: ",i); 20 | scanf("%f",&a[i]); 21 | } 22 | 23 | y1 = poly(a, deg, x); 24 | 25 | printf("The value of polynomial equation for the value of x = %.2f is: %.2f",x,y1); 26 | 27 | return 0; 28 | } 29 | 30 | /* function for finding the value of polynomial at some value of x */ 31 | float poly(float a[], int deg, float x) 32 | { 33 | float p; 34 | int i; 35 | 36 | p = a[deg]; 37 | 38 | for(i=deg;i>=1;i--) 39 | { 40 | p = (a[i-1] + x*p); 41 | } 42 | 43 | return p; 44 | } 45 | -------------------------------------------------------------------------------- /positiveInteger: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int exp(int,int); 4 | int main() 5 | { 6 | int a,b,s; 7 | printf("Enter values for X and Y:"); 8 | scanf("%d %d", &a,&b); 9 | s=exp(a,b); 10 | printf("%d",s); 11 | return 0; 12 | } 13 | int exp(int x, int y){ 14 | int res=1,a=x,b=y; 15 | while(b!=0){ 16 | if(b%2==0){ 17 | a=a*a; 18 | b=b/2; 19 | } 20 | else 21 | { 22 | res=res*a; 23 | b=b-1; 24 | } 25 | } 26 | return res; 27 | } 28 | -------------------------------------------------------------------------------- /prime: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | Output 29 | 30 | Enter a positive integer: 29 31 | 29 is a prime number. 32 | -------------------------------------------------------------------------------- /prime no between to intervals: -------------------------------------------------------------------------------- 1 | #include 2 | int main () 3 | { 4 | int i, prime, up, low, n; 5 | printf ("ENTER THE LOWER LIMIT : "); 6 | scanf ("%d", &low); 7 | printf ("ENTER THE UPPER LIMIT : "); 8 | scanf ("%d", &up); 9 | if(low>=2) 10 | { 11 | printf ("PRIME NUMBERS ARE : "); 12 | for (n = low + 1; n < up; n++) 13 | { 14 | prime = 1; 15 | for (i = 2; i < n/2; i++) 16 | if (n % i == 0) 17 | { 18 | prime = 0; 19 | break; 20 | } 21 | if (prime) 22 | printf ("\t %d", n); 23 | } 24 | } 25 | else 26 | { 27 | printf("Enter lower number must be greater than 1"); 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /prime number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /prime_or_not: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int i,n,prime=1; 5 | printf("Enter number"); 6 | scanf("%d",&n); 7 | 8 | if(n==1){ 9 | printf("1 is not a prime number"); 10 | } 11 | 12 | else if(n==2){ 13 | printf("2 is not a prime number"); 14 | } 15 | 16 | else{ 17 | for (i=2; i 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | Output 29 | 30 | Enter a positive integer: 29 31 | 29 is a prime number. 32 | -------------------------------------------------------------------------------- /primenumber: -------------------------------------------------------------------------------- 1 | /* C Program to Print Prime Numbers between 1 to 100 using For Loop */ 2 | 3 | #include 4 | 5 | int main() 6 | { 7 | int i, Number, count; 8 | 9 | printf(" Prime Number from 1 to 100 are: \n"); 10 | for(Number = 1; Number <= 100; Number++) 11 | { 12 | count = 0; 13 | for (i = 2; i <= Number/2; i++) 14 | { 15 | if(Number%i == 0) 16 | { 17 | count++; 18 | break; 19 | } 20 | } 21 | if(count == 0 && Number != 1 ) 22 | { 23 | printf(" %d ", Number); 24 | } 25 | } 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /primenumber1: -------------------------------------------------------------------------------- 1 | #include int main() 2 | { int n, i, flag = 0; printf("Enter a positive integer: "); 3 | scanf("%d", &n); for (i = 2; i <= n / 2; ++i) { 4 | // condition for non-prime if (n % i == 0) { flag = 1; break; } } 5 | if (n == 1) { printf("1 is neither prime nor composite."); } 6 | else { if (flag == 0) printf("%d is a prime number.", n); 7 | else printf("%d is not a prime number.", n); } return 0; } 8 | -------------------------------------------------------------------------------- /print an integer: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int number; 4 | 5 | printf("Enter an integer: "); 6 | 7 | // reads and stores input 8 | scanf("%d", &number); 9 | 10 | // displays output 11 | printf("You entered: %d", number); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /print n natural numbers: -------------------------------------------------------------------------------- 1 | /** 2 | * C program to print all natural numbers from 1 to n 3 | */ 4 | 5 | #include 6 | 7 | int main() 8 | { 9 | int i, n; 10 | 11 | /* Input upper limit from user */ 12 | printf("Enter any number: "); 13 | scanf("%d", &n); 14 | 15 | printf("Natural numbers from 1 to %d : \n", n); 16 | 17 | /* 18 | * Start loop counter from 1 (i=1) and go till n (i<=n) 19 | * increment the loop count by 1 to get the next value. 20 | * For each repetition print the value of i. 21 | */ 22 | for(i=1; i<=n; i++) 23 | { 24 | printf("%d\n", i); 25 | } 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /print rainbow: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | void main() 6 | { 7 | int gdriver = DETECT,gmode; 8 | int x,y,i; 9 | initgraph(&gdriver,&gmode,”C:\\Turboc3\\BGI”); 10 | x=getmaxx()/2; 11 | y=getmaxy()/2; 12 | for(i=30;i<200;i++) 13 | { 14 | delay(100); 15 | setcolor(i/10); 16 | arc(x,y,0,180,i-10); 17 | } 18 | getch(); 19 | } 20 | 21 | //please sir accept my pull. 22 | -------------------------------------------------------------------------------- /printing pattern: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, j, rows; 4 | printf("Enter the number of rows: "); 5 | scanf("%d", &rows); 6 | for (i = 1; i <= rows; ++i) { 7 | for (j = 1; j <= i; ++j) { 8 | printf("* "); 9 | } 10 | printf("\n"); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /product: -------------------------------------------------------------------------------- 1 | Program to Multiply Two Numbers 2 | 3 | #include 4 | int main() { 5 | double a, b, product; 6 | printf("Enter two numbers: "); 7 | scanf("%lf %lf", &a, &b); 8 | 9 | 10 | product = a * b; 11 | 12 | 13 | printf("Product = %.2lf", product); 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /prog.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n,i,m=0,flag=0; 4 | printf("Enter the number to check prime:"); 5 | scanf("%d",&n); 6 | m=n/2; 7 | for(i=2;i<=m;i++) 8 | { 9 | if(n%i==0) 10 | { 11 | printf("Number is not prime"); 12 | flag=1; 13 | break; 14 | } 15 | } 16 | if(flag==0) 17 | printf("Number is prime"); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /program to check leap year: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int year; 4 | printf("Enter a year: "); 5 | scanf("%d", &year); 6 | 7 | // leap year if perfectly visible by 400 8 | if (year % 400 == 0) { 9 | printf("%d is a leap year.", year); 10 | } 11 | else if (year % 100 == 0) { 12 | printf("%d is not a leap year.", year); 13 | } 14 | else if (year % 4 == 0) { 15 | printf("%d is a leap year.", year); 16 | } 17 | else { 18 | printf("%d is not a leap year.", year); 19 | } 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /program to check vowel using switch case: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | printf("\n\n\t\tStudytonight - Best place to learn\n\n\n"); 6 | 7 | char ch; 8 | printf("Input a Character : "); 9 | scanf("%c", &ch); 10 | 11 | switch(ch) 12 | { 13 | case 'a': 14 | case 'A': 15 | case 'e': 16 | case 'E': 17 | case 'i': 18 | case 'I': 19 | case 'o': 20 | case 'O': 21 | case 'u': 22 | case 'U': 23 | printf("\n\n%c is a vowel.\n\n", ch); 24 | break; 25 | default: 26 | printf("%c is not a vowel.\n\n", ch); 27 | } 28 | printf("\n\n\t\t\tCoding is Fun !\n\n\n"); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /program to find the greatest of two numbers in C: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int a, b, big; 6 | printf("Enter any two number: "); 7 | scanf("%d%d", &a, &b); 8 | if(a>b) 9 | big=a; 10 | else 11 | big=b; 12 | printf("\nBiggest of the two number is: %d", big); 13 | getch(); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /program to print integer: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int number; 4 | 5 | printf("Enter an integer: "); 6 | 7 | // reads and stores input 8 | scanf("%d", &number); 9 | 10 | // displays output 11 | printf("You entered: %d", number); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /pryamid using *: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int r, s, rows=0; 4 | int t=0; 5 | clrscr(); 6 | printf("Enter number of rows to print the pyramid: "); 7 | scanf("%d", &rows); 8 | printf("\n"); 9 | printf("The Pyramid Pattern for the number of rows are:"); 10 | printf("\n\n"); 11 | for(r=1;r<=rows;++r,t=0) { 12 | for(s=1; s<=rows-r; ++s){ 13 | printf(" "); 14 | } 15 | while (t!=2*r-1) { 16 | printf("* "); 17 | ++t; 18 | } 19 | printf("\n"); 20 | } 21 | getch(); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /pyramid of *: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, space, rows, k = 0; 4 | printf("Enter the number of rows: "); 5 | scanf("%d", &rows); 6 | for (i = 1; i <= rows; ++i, k = 0) { 7 | for (space = 1; space <= rows - i; ++space) { 8 | printf(" "); 9 | } 10 | while (k != 2 * i - 1) { 11 | printf("* "); 12 | ++k; 13 | } 14 | printf("\n"); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /reverse number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, rev = 0, remainder; 4 | printf("Enter an integer: "); 5 | scanf("%d", &n); 6 | while (n != 0) { 7 | remainder = n % 10; 8 | rev = rev * 10 + remainder; 9 | n /= 10; 10 | } 11 | printf("Reversed number = %d", rev); 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /reverse_a_string: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | char s[100]; 6 | 7 | printf("Enter a string to reverse\n"); 8 | gets(s); 9 | 10 | strrev(s); 11 | 12 | printf("Reverse of the string: %s\n", s); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /reverse_digits: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | /* Iterative function to reverse digits of num*/ 4 | int reversDigits(int num) 5 | { 6 | int rev_num = 0; 7 | while(num > 0) 8 | { 9 | rev_num = rev_num*10 + num%10; 10 | num = num/10; 11 | } 12 | return rev_num; 13 | } 14 | 15 | /*Driver program to test reversDigits*/ 16 | int main() 17 | { 18 | int num = 3217; 19 | printf("Reverse of no. is %d", reversDigits(num)); 20 | 21 | getchar(); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /reversestr: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | char s[100]; 6 | 7 | printf("Enter a string to reverse\n"); 8 | gets(s); 9 | 10 | strrev(s); 11 | 12 | printf("Reverse of the string: %s\n", s); 13 | 14 | return 0; 15 | } 16 | 17 | -------------------------------------------------------------------------------- /reversing of string: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char s[1000], r[1000]; 5 | int begin, end, count = 0; 6 | 7 | printf("Input a string\n"); 8 | gets(s); 9 | 10 | // Calculating string length 11 | 12 | while (s[count] != '\0') 13 | count++; 14 | 15 | end = count - 1; 16 | 17 | for (begin = 0; begin < count; begin++) { 18 | r[begin] = s[end]; 19 | end--; 20 | } 21 | 22 | r[begin] = '\0'; 23 | 24 | printf("%s\n", r); 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /sachdevakh: -------------------------------------------------------------------------------- 1 | // C program to find the greatest of two numbers 2 | 3 | #include 4 | int main() 5 | { 6 | //Fill the code 7 | int num1, num2; 8 | scanf(“%d %d”,&num1,&num2); 9 | if(num1 > num2) 10 | { 11 | printf(“%d is greater”,num1); 12 | } 13 | else 14 | { 15 | printf(“%d is greater”,num2); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /seedIT: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | 6 | printf("Seed IT Solution is great") 7 | 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /selectionsort: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() { 7 | 8 | int n,i,j,min,c=0; 9 | scanf("%d",&n); 10 | int a[n]; 11 | 12 | for(i=1;i<=n;i++) 13 | scanf("%d",&a[i]); 14 | 15 | for(i=1;i<=n-1;i++) 16 | { 17 | min = i; 18 | for(j=i+1;j<=n;j++) 19 | { 20 | c++; 21 | if (a[j] < a[min]) 22 | { 23 | min = j; 24 | } 25 | } 26 | if(min!=i) 27 | { 28 | int temp=a[i]; 29 | a[i]=a[min]; 30 | a[min]=temp; 31 | } 32 | } 33 | 34 | for(i=1;i<=n;i++) 35 | printf("%d ",a[i]); 36 | printf("\n%d\n%d",c,n-1); 37 | 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /sentence to a file: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | char sentence[1000]; 6 | 7 | // creating file pointer to work with files 8 | FILE *fptr; 9 | 10 | // opening file in writing mode 11 | fptr = fopen("program.txt", "w"); 12 | 13 | // exiting program 14 | if (fptr == NULL) { 15 | printf("Error!"); 16 | exit(1); 17 | } 18 | printf("Enter a sentence:\n"); 19 | fgets(sentence, sizeof(sentence), stdin); 20 | fprintf(fptr, "%s", sentence); 21 | fclose(fptr); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /shutdown_using_c: -------------------------------------------------------------------------------- 1 | // C program to shutdown in Linux 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | // Running Linux OS command using system 8 | system("shutdown -P now"); 9 | 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /simple interest finder.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int p,n,r,si; 6 | clrscr(); 7 | printf("Enter Principle, Rate of interest & Time :"); 8 | scanf("%d%d%d",&p,&r,&n); 9 | si=(p*r*n)/100; 10 | printf("Simple Interest is :%d",si); 11 | getch(); 12 | } 13 | -------------------------------------------------------------------------------- /sine_series: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int i, j, n, fact, sign = - 1; 6 | float x, p, sum = 0; 7 | 8 | printf("Enter the value of x : "); 9 | scanf("%f", &x); 10 | printf("Enter the value of n : "); 11 | scanf("%d", &n); 12 | 13 | for (i = 1; i <= n; i += 2) 14 | { 15 | p = 1; 16 | fact = 1; 17 | for (j = 1; j <= i; j++) 18 | { 19 | p = p * x; 20 | fact = fact * j; 21 | } 22 | sign = - 1 * sign; 23 | sum += sign * p / fact; 24 | } 25 | 26 | printf("sin %0.2f = %f", x, sum); 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /square of a number: -------------------------------------------------------------------------------- 1 | // by ankit pal 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int number, Square; 8 | 9 | printf(" \n Please Enter any integer Value : "); 10 | scanf("%d", &number); 11 | 12 | Square = number * number; 13 | 14 | printf("\n Square of a given number %d is = %d", number, Square); 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /squarepogram: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | double square(double num) 4 | { 5 | return (num * num); 6 | } 7 | int main() 8 | { 9 | int num; 10 | double n; 11 | printf("\n\n Function : find square of any number :\n"); 12 | printf("------------------------------------------------\n"); 13 | 14 | printf("Input any number for square : "); 15 | scanf("%d", &num); 16 | n = square(num); 17 | printf("The square of %d is : %.2f\n", num, n); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /standard deviation: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | float calculateSD(float data[]); 4 | int main() { 5 | int i; 6 | float data[10]; 7 | printf("Enter 10 elements: "); 8 | for (i = 0; i < 10; ++i) 9 | scanf("%f", &data[i]); 10 | printf("\nStandard Deviation = %.6f", calculateSD(data)); 11 | return 0; 12 | } 13 | 14 | float calculateSD(float data[]) { 15 | float sum = 0.0, mean, SD = 0.0; 16 | int i; 17 | for (i = 0; i < 10; ++i) { 18 | sum += data[i]; 19 | } 20 | mean = sum / 10; 21 | for (i = 0; i < 10; ++i) 22 | SD += pow(data[i] - mean, 2); 23 | return sqrt(SD / 10); 24 | } 25 | -------------------------------------------------------------------------------- /string task: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int i,l; 6 | char s[101]; 7 | scanf("%s",s); 8 | l=strlen(s); 9 | for(i=0; i 2 | 3 | int main() 4 | { 5 | int a,b,sub; 6 | 7 | //Read value of a 8 | printf("Enter the first no.: "); 9 | scanf("%d",&a); 10 | 11 | //Read value of b 12 | printf("Enter the second no.: "); 13 | scanf("%d",&b); 14 | 15 | //formula of subtraction 16 | sub= a-b; 17 | printf("subtract is = %d\n", sub); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /subtract: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,sub; 6 | 7 | //Read value of a 8 | printf("Enter the first no.: "); 9 | scanf("%d",&a); 10 | 11 | //Read value of b 12 | printf("Enter the second no.: "); 13 | scanf("%d",&b); 14 | 15 | //formula of subtraction 16 | sub= a-b; 17 | printf("subtract is = %d\n", sub); 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /sum of two integer: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | int a ,b,c; 6 | printf("Enter the two numbers you want to add:\n"); 7 | scanf("%d%d",&a,&b); 8 | c=a+b; 9 | printf("\n The sum of %d and %d is %d",a,b,c); 10 | getch(); 11 | } 12 | -------------------------------------------------------------------------------- /sum of two no.: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | 4 | int number1, number2, sum; 5 | 6 | printf("Enter two integers: "); 7 | scanf("%d %d", &number1, &number2); 8 | 9 | // calculating sum 10 | sum = number1 + number2; 11 | 12 | printf("%d + %d = %d", number1, number2, sum); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /sumno: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a = 4; 6 | float b = 8.5; 7 | int c = 6; 8 | 9 | printf("the value of a is %d \n", a); 10 | printf("the value of b is %f \n", b); 11 | printf("sum of a and b is %f" , a + b); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /swap two numbers without third variable: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a=10, b=20; 5 | printf("Before swap a=%d b=%d",a,b); 6 | a=a+b;//a=30 (10+20) 7 | b=a-b;//b=10 (30-20) 8 | a=a-b;//a=20 (30-10) 9 | printf("\nAfter swap a=%d b=%d",a,b); 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /swapping of two numbers: -------------------------------------------------------------------------------- 1 | 2 | // C program to swap two variables 3 | #include 4 | 5 | int main() 6 | { 7 | int x, y; 8 | printf("Enter Value of x "); 9 | scanf("%d", &x); 10 | printf("\nEnter Value of y "); 11 | scanf("%d", &y); 12 | 13 | int temp = x; 14 | x = y; 15 | y = temp; 16 | 17 | printf("\nAfter Swapping: x = %d, y = %d", x, y); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /swaptwonumber: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | double first, second, temp; 4 | printf("Enter first number: "); 5 | scanf("%lf", &first); 6 | printf("Enter second number: "); 7 | scanf("%lf", &second); 8 | 9 | // Value of first is assigned to temp 10 | temp = first; 11 | 12 | // Value of second is assigned to first 13 | first = second; 14 | 15 | // Value of temp (initial value of first) is assigned to second 16 | second = temp; 17 | 18 | printf("\nAfter swapping, firstNumber = %.2lf\n", first); 19 | printf("After swapping, secondNumber = %.2lf", second); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /the hollow square star pattern: -------------------------------------------------------------------------------- 1 | int main() 2 | { 3 | int n; 4 | printf("Enter the number of rows"); 5 | scanf("%d",&n); 6 | for(int i=1;i<=n;i++) 7 | { 8 | for(int j=1;j<=n;j++) 9 | { 10 | if(i==1 ||i==n||j==1||j==n) 11 | { 12 | printf("*"); 13 | } 14 | else 15 | printf(" "); 16 | } 17 | printf("\n"); 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /threegreternumber: -------------------------------------------------------------------------------- 1 | program to find the greatest of three numbers 2 | 3 | #include 4 | int main() 5 | { 6 | //Fill the code 7 | int num1, num2, num3; 8 | scanf(“%d %d %d”,&num1,&num2,&num3); 9 | if(num1 > num2 && num1 > num3) 10 | { 11 | printf(“%d is greater”,num1); 12 | } 13 | else if(num2 > num1 && num2 > num3) 14 | { 15 | printf(“%d is greater”,num2); 16 | } 17 | else 18 | { 19 | printf(“%d is greater”,num3); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /to find armstrong numbers using recursion: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int Number, Temp, Reminder, Times =0, Sum = 0; 7 | 8 | printf("\nPlease Enter number to Check for Armstrong \n"); 9 | scanf("%d", &Number); 10 | 11 | //Helps to prevent altering the original value 12 | Temp = Number; 13 | while (Temp != 0) 14 | { 15 | Times = Times + 1; 16 | Temp = Temp / 10; 17 | } 18 | 19 | Temp = Number; 20 | while( Temp > 0) 21 | { 22 | Reminder = Temp %10; 23 | Sum = Sum + pow(Reminder, Times); 24 | Temp = Temp /10; 25 | } 26 | 27 | printf("\n Sum of entered number is = %d\n", Sum); 28 | 29 | if ( Number == Sum ) 30 | printf("\n %d is Armstrong Number.\n", Number); 31 | else 32 | printf("\n %d is not a Armstrong Number.\n", Number); 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /to find fibonacci series: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, n, t1 = 0, t2 = 1, nextTerm; 4 | printf("Enter the number of terms: "); 5 | scanf("%d", &n); 6 | printf("Fibonacci Series: "); 7 | 8 | for (i = 1; i <= n; ++i) { 9 | printf("%d, ", t1); 10 | nextTerm = t1 + t2; 11 | t1 = t2; 12 | t2 = nextTerm; 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /to find prime number: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int n, i, flag = 0; 4 | printf("Enter a positive integer: "); 5 | scanf("%d", &n); 6 | 7 | for (i = 2; i <= n / 2; ++i) { 8 | 9 | // condition for non-prime 10 | if (n % i == 0) { 11 | flag = 1; 12 | break; 13 | } 14 | } 15 | 16 | if (n == 1) { 17 | printf("1 is neither prime nor composite."); 18 | } 19 | else { 20 | if (flag == 0) 21 | printf("%d is a prime number.", n); 22 | else 23 | printf("%d is not a prime number.", n); 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /tower of hanoi: -------------------------------------------------------------------------------- 1 | void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) 2 | { 3 | if (n == 1) 4 | { 5 | printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod); 6 | return; 7 | } 8 | towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 9 | printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod); 10 | towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 11 | } 12 | 13 | int main() 14 | { 15 | int n = 4; // Number of disks 16 | towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /triangular patterns: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int i, j, rows; 4 | printf("Enter the number of rows: "); 5 | scanf("%d", &rows); 6 | for (i = 1; i <= rows; ++i) { 7 | for (j = 1; j <= i; ++j) { 8 | printf("* "); 9 | } 10 | printf("\n"); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /ugly numbers: -------------------------------------------------------------------------------- 1 | # include 2 | # include 3 | 4 | int main() 5 | { 6 | int n,x=0; 7 | printf("Input an integer number: "); 8 | scanf("%d",&n); 9 | 10 | if (n <= 0) { 11 | printf("Input a correct number."); 12 | } 13 | while (n != 1) 14 | { 15 | if (n % 5 == 0) 16 | { 17 | n /= 5; 18 | } 19 | else if (n % 3 == 0) 20 | { 21 | n /= 3; 22 | } 23 | else if (n % 2 == 0) 24 | { 25 | n /= 2; 26 | } 27 | else 28 | { 29 | printf("It is not an ugly number.\n"); 30 | x = 1; 31 | break; 32 | } 33 | } 34 | if (x==0) 35 | { 36 | printf("It is an ugly number.\n"); 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /use of bitwise operators: -------------------------------------------------------------------------------- 1 | // C Program to demonstrate use of bitwise operators 2 | #include 3 | int main() 4 | { 5 | // a = 5(00000101), b = 9(00001001) 6 | unsigned char a = 5, b = 9; 7 | 8 | // The result is 00000001 9 | printf("a = %d, b = %d\n", a, b); 10 | printf("a&b = %d\n", a & b); 11 | 12 | // The result is 00001101 13 | printf("a|b = %d\n", a | b); 14 | 15 | // The result is 00001100 16 | printf("a^b = %d\n", a ^ b); 17 | 18 | // The result is 11111010 19 | printf("~a = %d\n", a = ~a); 20 | 21 | // The result is 00010010 22 | printf("b<<1 = %d\n", b << 1); 23 | 24 | // The result is 00000100 25 | printf("b>>1 = %d\n", b >> 1); 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /while loop: -------------------------------------------------------------------------------- 1 | // Print numbers from 1 to 5 2 | 3 | #include 4 | int main() 5 | { 6 | int i = 1; 7 | 8 | while (i <= 5) 9 | { 10 | printf("%d\n", i); 11 | ++i; 12 | } 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /zombieprocess.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | // fork() creates child process identical to parent 8 | int pid = fork(); 9 | 10 | // if pid is greater than 0 than it is parent process 11 | // if pid is 0 then it is child process 12 | // if pid is -ve , it means fork() failed to create child process 13 | 14 | // Parent process 15 | if (pid > 0) 16 | sleep(20); 17 | 18 | // Child process 19 | else 20 | { 21 | exit(0); 22 | } 23 | 24 | return 0; 25 | 26 | } 27 | --------------------------------------------------------------------------------