C program to find Factorial of any number

-
#include<stdio.h>
int main()
{
int num, fact=1, i=1;
printf("enter any number to find factorial \t");
scanf("%d",&num);
while(i<=num)
{
fact=fact*i;
i++;
}
printf("factorial = %d",fact);
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Storage Class in C

-
Image
          Storage Class in C Programming                                                (variable storage class)                          From compiler point of view, a variable name identify some physical location in any computer when a string of bits representing a variables value stored. There are basically two kind of location in computer where such values are stored - 1. CPU Registers 2. Main Memory                        It is variable storage class that determine in which of these two types of location, ...
Read more

Handwritten Digits Recognition using Machine Learning

-
Image
      Recognizing Handwritten Digits with scikit-learn                                   In this project we will try to recognize handwritten digits using machine learning models like support vector machine and random forest classifier with the help of scikit-learn library. Handwriting Recognition                                  Handwritten text recognition is one of the most challenging task so to address this issue scikit-learn library plays important role to better understanding this technique. But people often think about OCR (Optical Character Recognition) software that can read text, pdf or other electronic documents. But this problem by choosing statistical approach may be optimal solution. You can read about scikit-learn library from this  scikit-learn: mac...
Read more

Bubble Sort Program in Java

-
Image
                      BUBBLE SORT PROGRAM USING JAVA                                           In Bubble sort we compare two consecutive elements of an array, if first one element is greater than next one then swap them. The time complexity in worst and average case is O(n^2) while in best case is O(n) and the space complexity is O(1) . package bubbleSort; public class BubbleSort { public static void bubbleSort(int[] arr) { for(int i=0; i<arr.length; i++) { for(int j=i+1; j<arr.length; j++) { if(arr[i] > arr[j]) { // swap the numbers int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } }          // main method  public static void main(String[] args) {         // declare and assign an unsorted array  i...
Read more