Contact

Popular posts from this blog

Data Structure Algorithm Programmatic Illustration

 //////////////////////////////////////////////////////////////////////////////// //   Program Name: DataStructureAlgorithm.c //   Description : This program shows the demonstration of all data structure //                 algorithms. //   Author :      Sunil V. Bhagwat //   Created Date : 15 August 2023 //   Modified Date: 16 August 2023 ////////////////////////////////////////////////////////////////////////////////                                                                                          #include<stdio.h> #include<stdlib.h> #define MAX 100 // CheckFor:  Create new Array  void CreateArray(int A[], int n){            // CheckFor: Declaration of local variable      int i = 0;            // Checkfor: Accept the array elements      printf("Enter the array element: \n");            // LoopFor: Accepet the array elements      for ( i = 0; i < n; i++)           scanf("%d", &A[i]);  } // CheckFor:  Display the Array void DisplayArray(int
Read more

Quick Sort Algorithm

 #include<stdio.h> #include<stdlib.h> int A[50], n; // CheckFor:  Create new Array  void CreateArray(){            // CheckFor: Declaration of local variable      int i = 0;                 // LoopFor: Accepet the array elements using random function      for ( i = 0; i < n; i++)           A[i] = rand();  } // CheckFor:  Display the Array void DisplayArray(){      // CheckFor: Declaration of local variable           int i = 0;            // Checkfor: Display the array elements      printf("The array elements are: \t");            // LoopFor: Display the array elements      for ( i = 0; i < n; i++)           printf("%d \t", A[i]);  } void QuickSort(int low, int high){      // CheckFor: Declaration of local variable       int pivot, t, i, j;            // CheckFor: Array is empty or not      if ( low <= high){           // CheckFor: Initialise the pivot, low and high           pivot = A[low];           i = low + 1;           j = high;             
Read more

SYB.B.A.(C.A.) Sem III : Data Structure Slip 10 Que - 1 B

SAVITIBAI PHULE UNIVERSITY OF PUNE S. Y. B.B.A. (C.A.) Semester III Practical Examination Lab Course: (CA-306) Computer Laboratory Based on 302, 304 and 305  Data Structure, Angular JS/ PHP, Big Data / Block Chain /*     Q.1 B) Write a 'C' program to sort randomly generated array elements using insertion sort method.      (Use Random Function) */ #include<stdio.h> #include<stdlib.h> #define MAX 100 // CheckFor:  Create new Array  void CreateArray(int A[], int n){            // CheckFor: Declaration of local variable      int i = 0;               // LoopFor: Assingn the random array elements      for ( i = 0; i < n; i++)           A[i] = rand();  } // CheckFor:  Display the Array void DisplayArray(int A[], int n){      // CheckFor: Declaration of local variable           int i = 0;            // LoopFor: Display the array elements      for ( i = 0; i < n; i++)           printf("%d \t", A[i]);  } // CheckFor:  Sort the Array Element using Insertion Sor
Read more