Question

Q1. [10 pts] Write an algorithm for Bubble sort that sorts array of n integers. Indicate the expected time complexity of the algorithm using the big-O notation. Use the following format for an algorithm pseudocode Function header (.....) Input: Output: Algorithm steps: 1. 2.

Answer 1

void bubble Cinta[], int n) {inti, j, for Ciao Bubble gort - Analysis / Bubble Sore for integer * # delve saap (art) fint t; tza, a= b; b- e;} icn; i++) { /*n passes thou the array *//* From start to the end of unsorted part */ for (J-17 JC (2.1); j++) 11 optimized implementation of Bubble sort # include <stdio.h> void swap (int *xp, int *yp) { int temp - *xP) *xP = *YPY XP = = *YPY YP tempi

/* Function to print an arrayt / vold print Array (int arr [], int size) { alog bic ( int i, for (inoy ic size, itt) a () Go printf ("xod" ar ),.. printf ("n"); 3 do odola befimigo out put :- Sorted array ! 1 12 22 25 34 64 90 bou wi

pablic class Bubble sort & public static void main(String[] args) { { 3,5,1, 2, 7, 9, 6, 10,43; int[] arra 9y51em out paintin ("Arrainy Bobre sorting"); display Array (arr); bubble goot carr); gysleme .out. printing; lyglem .out. display Array (art); printin (Array After sorting "], 3 private Stalte void display Array (int L] arr) { for (int i=0; i Lars length, itt) & System.out.print (arr [] + "")); } 3 Out pot. 4 Array Before gooting. 1 2 7 9 6 8 10 3 3 Array After sorting To, 7 8 9 3 2 и 5 6