Searching It means to find the location of an item/element/value in an array/list. It will return or print the location of the item , if the item is present in the list/array, otherwise it will print “Not Found” or return a non valid index (say -1) Linear Search It searches the element in the list …
Linear Searching Find an element in the two dimensional array Read More »
Searching It means to find the location of an item/element/value in an array/list. It will return or print the location of the item , if the item is present in the list/array, otherwise it will print “Not Found” or return a non valid index (say -1) Linear Search It searches the element in the list …
Linear Searching Find an element in the list/1-D array Using Function Read More »
Logic: Algorithm Time Complexity: O(n) Space Complexity: O(1) Program #include <stdio.h> char check_prime(int n); int main() { printf(“******************************************************\n”); printf(“******************************************************\n”); printf(“** WAP to check a number for prime using function **\n”); printf(“** Created by Sheetal Garg **\n”); printf(“** Assistant Professor **\n”); printf(“** Phone No:9467863365 **\n”); printf(“******************************************************\n”); printf(“******************************************************\n”); int n; char result; printf(“\nenter number\n”); scanf(“%d”, &n); result …
Program to check a number for prime in C using function Read More »
Logic: Enter the number n Product or Factorial= 1 x 2x 3 x 4 x………x n Algorithm Enter the number as n Initially assign product=1 for(i=1;i<=n;i++) product= product Time Complexity: O(n) Space Complexity: O(1) Program #include <stdio.h> int fact(int n); int main() { printf(“****************************************************************\n”); printf(“****************************************************************\n”); printf(“** WAP to print factorial of a number n using …
Program to print factorial/product of first n natural numbers using Function Read More »
Logic: Enter the number n sum= 13 + 23+ 33 + 43+……..+n3 Algorithm Enter the number as n Initially assign sum=0 for(i=1;i<=n;i++) sum=sum + i * i * i; Print sum Time Complexity: O(n) Space Complexity: O(1) Program #include <stdio.h> int findsum(int n); int main() { printf(“****************************************************************\n”); printf(“****************************************************************\n”); printf(“** WAP to print sum of cubes …
Program to print sum of cubes of first n natural numbers using Function Read More »
Logic: Enter the number n sum= 12 + 22+ 32 + 4 2+……..+n2 Algorithm Enter the number as n Initially assign sum=0 for(i=1;i<=n;i++) sum=sum + i * i; Print sum Time Complexity: O(n) Space Complexity: O(1) Program #include <stdio.h> int findsum(int n); int main() { printf(“****************************************************************\n”); printf(“****************************************************************\n”); printf(“** WAP to print sum of squares of …
Program to print sum of squares of first n natural numbers using Function Read More »
Logic: Enter the number n sum= 1 + 2+ 3 + 4 +……..+n Algorithm Enter the number as n Initially assign sum=0 for(i=1;i<=n;i++) sum=sum+i; Print sum Time Complexity: O(n) Space Complexity: O(1) Program #include <stdio.h> int findsum(int n); int main() { printf(“****************************************************************\n”); printf(“****************************************************************\n”); printf(“** WAP to print sum of first n natural numbers using function …
Program to print sum of first n natural numbers using Function Read More »
Logic: Divisor A number is called divisor of another no n if it divides the number completely i.e leaving the remainder 0 Enter the number n Example : n=15 We will check whether number is divisible by any number from 1 to n here 15. If it is divisible by any number (example 15 is …
Program to print Divisors of a number Using Function Read More »
Program // Prim’s Algorithm in C #include <stdio.h> #include <stdbool.h> #define INF 9999999 // number of vertices in graph #define V 5 // create a 2d array of size 5×5 // for adjacency matrix to represent graph int G[V][V] = { {0, INF, 75, 0, 0}, {9, 0, 95, 19, 42}, {75, 95, 0, 51, …
Program to find Minimum Spanning Tree MST of a graph using Prim’s Algorithm in C Read More »
Program #include <stdio.h> #include <conio.h> int s, c[100][100], ver; float optimum = 999, sum; /* function to swap array elements */ void swap(int v[], int i, int j) { int t; t = v[i]; v[i] = v[j]; v[j] = t; } /* recursive function to generate permutations */ void brute_force(int v[], int n, int i) …