Scribd Logo
Upload

Welcome to Scribd!

  • 4&5

    Uploaded by

    Maxite
    9 views9 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    9 views9 pages

    4&5

    Uploaded by

    Maxite

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 9
    Dept of CSE. K.S.LT Program 4 Sort a given set of nm integer elements using-Quick Sort method and compute Its time complexity. Run the program for varied values of n > 5000 and record the time taken to sort, Plot a graph of the time taken versus 1 on graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the divide-and-conquer method works along with its time complexity analysis: worst case, average case and best case. ALGORITHM ; ALGORITHM Quicksort(A/L... D WSorts subarray by quicksort Munput: A subarray A/l...r] of A[0...n-1], defined by its ieft and right indices / and r Output: Subarray A/1...r] sorted in non decreasing order. Iflp répeat j — j-/ until Afi]

    ] swap(A[i, A[j]) Mundo last swap when i> j swap(A/l], ALi) return j DAA Laboratory Manual (I8CSL47) Page 34 & scanned with OKEN Scanner Dept. of CSE SLT Ol SE Sy CODE: import java.util. import java.io.*; | public class P4 { static int [] static int n; static boolean flag ~ -true; public static void quicksort (int [] a,int low,int high) { ant islow,j=high; int temp; Ant pivot = a[(lowthigh) /2]7 if(£lag) ( ; while (i<=}) { : ‘ while (a(t) pivor) Ds}, % im fd) ( ry 4 if (low<3) quicksort (a,1ow,j); if(ishigh) quicksort(a,i,high) ; while (i<=j) { while(ali]>pivot) itt while (a[j]” Cay ( Ant is ong streets eyed Yume Scanner read=new Scanner (Syster Random random= new Random() printWriter out = new PrintWriter (new File("Random.txt"))7 system.out-printIn("Enter the no elements (>5000) nexead.nextInt ()7 a= new int{n]? -candom.nextInt (n) +17 yeint (a[i)+"\t")s A sySbeavout-printin "the total numbers generated: "+ 4) YJ Ode.ctose (7 st = System.nanoTime () 7 quicksort (a, 0/n-1) 7 et= system.nanoTime() - st A = new PrintWeiter(new File("Ascending. txt")) PrintWriter out for (i=0sicnsit+) outA.print (a(i]#"\t") outA.close() 7 6 DAA Laboratory Manial (18CSL47) Page 3 & scanned with OKEN Scanner et SE system.out print1n ("THE TIME COMPLEXITY FOR WORST CASE 1S. + (et/1000000000.0) + " secs")? st = System.nanoTime() quicksort (a, 0,n-1) 7 et= System.nanoTime() - str System.out.printIn ("THE TIME COMPLEXITY FOR BEST CASE IS... " + {et/1000000000.0)+ * secs") ; flagefalse st = System.nanoTime()+ quicksort (a,0,n-1); et = System.nanoTime()- sty PrintWriter outD = new PrintWriter(new File("Descending.txt"))7 for (in0;icnsit+) outD.print (a[i]+"\ outD.close() System.out.print1n ("THE TIME COMPLEXITY FOR AVERAGE CASE IS "+ (et/1000000000.0) + " secs"); ) ) Data Table : Time (in Size(n) seconds) ma Worst case Best case ‘Average A} case 6000 “S 0.001466 2.32E-04 2.47E-04 ‘8500 1.84E-03 3.42E-04 3.46E-04 11000 0.002214 4426-04 4516-04 13500 0.002455 5.83E-04 5.50E-04 16000 (0.002775 6.42E-04 6.47E-04 718500 0.003276 7.60E-04 7.216-04 21000 0.003973 8.33E-04 8.46E-04 23500. 0.004496 9.48E-04 = 9.54E-04 26000 4.79E-03 1.03E-03 0.001022, 28500 0.005, 0.001099 0.001108, 31000 0.005399 1.24E-03 0.001186, 33500 5.53E-03 1.34E-03 (0.001273 36000 0.005982 0.001493 0.001434 38500 0.006375 0.001611 0.001582 DAA Laboratory Manual (18CSL47) Page 3 & scanned with OKEN Scanner Dept. of CSE Program 5 Sort a given set of m Integer elements using Merge Sort complexity. Run the program for varied values of > 5000, Sort. Plot 2 graph of the time taken versus 1 on graph shee! from a file or can be generated using the random number gon Java how the divide-and-conquer method works along with Its worst case, average case and best case. method and compute its time ‘and record the time taken to t, The elements can be read ‘erator. Demonstrate using time complexity analysis: ALGORITHM; ALGORITHM Mergesort(A{0..n-1]) Sorts array A[0..n-1] by recursive mergesort . /Mnput: An array A[0..n-I] of orderable elements Output: Array A[0..1-1] sorted in non decreasing ofder: Ifm1 copy A/0...L/2)-1] to BO... (O/2|-17 copy Af [O/2)...1-1) to C/fOI2I <1] Mergesort(B{0... (0/2\-1]) Mergesort(Cf0...[0/21-1)) Merge(B, C, A) ALGORITHM Merge(B[0...p-1],'C[03.4-1), A[0..P*+4-1]) /IMerges two sorted arays inti‘ one sorted array Minput: Arrays B[Qp-1] 2nd C[0..9-1] both sorted r+q-LJof the elements of B and C //Output: Sorted/array 4/0. 10,7 OF OY, whileimid) Troe (keigekchigh: ++, k++) bas bts) else : i for (keilskeemids j++, K++) & scanned with OKEN Scanner for (kelows kenhigh kt) atk}=bikl? else white ( (Lcemid) 46 (42<*high) ) ‘ Af (afil}>=ali2)) i big)ealitle sit: , 2 : else ( 4 , A jes ) if (i1>mid) else for We Arkewmids J++, ++) bijlmatkl; for (keLow;k5000)"); neread.nextInt (); . a= new int {n}; & scanned with OKEN Scanner nj ite) ald}=random.nextInt (n)41; out.print(alij+"\tn); } system. out .printin(™ e ‘-printin("The total numbers generated: "+ i 17 out.close(); st = System.nanoTime(); mergesort (a,0,n-1); et= System.nanoTime() - st; PrintWriter outA = new Printiriter(new File("Ascending.txt"))# for (

    You might also like