C Programming Archives - NTSEQ:- A IT Infrastructure and Cyber Security Blogs

Factorial Program in C Using Pointers

#include<stdio.h> void find_Factorial(int,int *); int main() { int i,fact,num; printf(“Please Enter a number: “); scanf(“%d”,&num); find_Factorial(num,&fact); printf(“Factorial of %d number

C program to check whether a number is Strong number or not

Strong Number:- A number is called strong number If the sum of factorial of the digits in any number is

C Program to Implement RADIX SORT Algorithm

#include<stdio.h> void radixsort(int arr[], int n); int main() { int arr[100],num,i; printf(“How many elements do you want to Enter for

Caesar Cipher Encryption & Decryption in C and C++

Caesar Cipher:- Caesar cipher is one of the earliest known and simplest ciphers. It is a type of replacement cipher

Insertion Sort Program in C

Implementing Insertion Sort Algorithm #include<stdio.h> int main() { int arr[20],num,Temp,i,j; printf(“\n\n How Many Number do you want to enter…: “);

C Program to Calculate Standard Deviation

Standard Deviation Program in C #include<stdio.h> #include <math.h> float standard_deviation(float data[]); int main() { int i; float arr[10]; printf(“Enter the

C Programming dangling pointer

Dangling Pointer in C The pointer variable which is pointing to a inactive or dead location is called dangling pointer.

Merge Sort Program in C

Program of a merge sort is below. Divide the first list into the smallest unit, then compare each element with

BUBBLE SORT

C Program – BUBBLE SORT Program Implementation. #include<stdio.h> int main() { int count,temp,i,j,arr[20]; printf(“How many numbers of elements do you

Quicksort Program in c

C Program – Quicksort Program implementation #include<stdio.h> void quick_sort(int arr_num[25],int first,int last){ int temp,i, j, pivot; if(first<last){ pivot=first; i=first;