GKV Paper

  Subject:- PHYSICS (BPH-E501), Digital and Analog Circuits and Instrumentation

Subject- MATHEMATICS (BMA-E503), Linear Algebra

Subject- MATHEMATICS (BMA-S504), Combinational Optimization

Subject-COMPUTER SCIENCE (BCS-E501), Operating system

BubbleSort                                   It is an inplace and comparison based sorting techoique.                                  In this algorithm each element is compared to its next element if they and not 'n' corooct order then swap these data item  go to the next element.       Algorithm of Bubble Sort            Bubblesort( a[Max],n)          This algo arrange the item of              array  in asscending order          a[Max]=a[0 to Max-1]         n= NO. of item in array STEP 1. Start STEP 2. for i=1 to n-1 do                (a){ for j=0 to n-1-i do                    if (a[j]>a[j+1]) trhen                    swap (a[j] and a[j+1] } STEP 3. stop Time Complexity     Total Comparesion=(n-1)+(n-2)+_                                               _ _+3+2+1                                              =N\2(a+l) +n-1\2(n-1+1) +(m-1)\2= T Program of Bubble Sort #include<iostream.h> #include<conio.h> void main() {   clrs

Algorithm Analysis note is here click the link⬇️ https://drive.google.com/file/d/1sXw_RWl4Ty1_BdkxLAhBpZcnzZu2SCB4/view?usp=drivesdk