Question

I've developed a new, super cool sorting algorithm. Here's the procedure:

Until sorted:

1. Randomly generate i = some number between 0 and n - 1 (n = size of array)
2. Randomly generate j = some number between i + 1 and n - 1
3. if array[i] > array[j], swap
4. Check to see if the array has been sorted

List the algorithm's efficiency using Big-O.

Answer 1

Answer: Sorting algorithm Initially it is generating Random numbers The outer loop checks the values from 0 to n-1 After that inner loop is checking the values from i+1 ton-1 It is taking place the sorting comparison Finally, the elements are being swapped The arrays are sorted Example code for the algorithm The algorithm can be rewritten as the below program Code: //Header files #include <stdio.h> # include<stdlib.h> //main method int main () //declares the variables int arrayVal [100], numl, cl, d1, swap; printf ("ENTER NUMBER OF ELEMENTS\n"); scanf("%d", &num1); printf ("Enter %d integers\n", num1); for (c10 c1< num1 c1++) scanf ("%d", &arrayva1 [c1]); //loops which defines the algorithms for (c1 -0 c1< (numl - 1 c1++) for (d1-0 d1 < num1 - cl - 1 d1++) //compares the values if (arrayVal[d1] arrayVal[d1+1])

//swaps the values swap arrayVal [d1] arrayVal[d1+1]; arrayval [d1+1] = swap ; arrayVal[d1]; //printing the results printf ("SORTED ORDER: n") f r ( c1 = 0 ; c1 < num1 ; c1++ ) printf ("%d\n", arrayval [c1]); system("pause") return 0; Sample Output: ENTER NUMBER OF ELEMENTS Enter 3 integers SORTED ORDER: Press any key to continue . Complexity: The Big O complexity of the given algorithm is O(

Executable code:

//Header files
#include <stdio.h>
#include<stdlib.h>
//main method
int main()
{
   //declares the variables
   int arrayVal[100], num1, c1, d1, swap;
   printf("ENTER NUMBER OF ELEMENTS\n");
   scanf("%d", &num1);
   printf("Enter %d integers\n", num1);
   for (c1 = 0; c1 < num1; c1++)
scanf("%d", &arrayVal[c1]);
   //loops which defines the algorithms
   for (c1 = 0 ; c1 < ( num1 - 1 ); c1++)
   {
       for (d1 = 0 ; d1 < num1 - c1 - 1; d1++)
       {
           //compares the values
           if (arrayVal[d1] > arrayVal[d1+1])
           {
               //swaps the values
               swap = arrayVal[d1];
               arrayVal[d1] = arrayVal[d1+1];
               arrayVal[d1+1] = swap;
           }
       }
}
//printing the results
printf("SORTED ORDER:\n");

for ( c1 = 0 ; c1 < num1 ; c1++ )
printf("%d\n", arrayVal[c1]);
system("pause");
return 0;
}