Question

The purpose of the project is to perform a timing experiment. You are required to complete the following activities: Write a computer program that prompts the user for a number, creates an array for that number of random integers, and then usees the bubble sort to order the array. The program should print out the array prior to the call to the sorting algorithm and afterwards. You can write the program in either Java, C++, C#, or whatever language you are most comfortable in. Do Not use an API from the language library. Write the program to perform the sort. Repeat 1 but use selection sort this time. Again, write out the program for the selection sort. DO not use the language library. 1 and 2 are primarily intended to make sure that your algorithms work. Once you are convinced your programs work, do the following Write a computer program that prompts the user for one number, n for the number of items in the array to sort, and create and sort 1000 different arrays of this size timing the run to get an average time to sort an array of this size. Then do the following: Initiate a variable running_time to 0 Create a for loop that iterates 1000 times. In the body of the loop, Create an array of n random integers Get the time and set this to start-time (notice the sort is started after each array is built. You want to time the srt process only). You will have to figure out what the appropriate command is in the programming language you are using to find the time (Important: Do not start the timer until after the array is created). Use bubble sort to sort the array Get the time and set this to end-time Subtract start-time from end-time and add the result to total_time Once the program has run, note The number of items sorted The average running time for each array (total_time/1000) Repeat the process using 500, 2500 and 5000 as the size of the array. Repeat 3 using selection sort. You now have 6 data points ( the averages from the three array sizes for the two sort algorithms) Create a spreadsheet showing the results of 3 and 4 and create a graph to graphically represent the information. Show both sort algorithms on the same graph for comparison. Write a one page document explaining the results, bearing in mind that both algorithms have a complexity of O(n^2) and what you know about complexity analysis. Use your knowledge of complexity analysis to explain your results.

Please, I need main focus on the one page paper explaining the results!

Answer 1

first of all we need to take the value of n ie number of element array element we have to enter by using

in c language

print("enter value of n");

scanf("%d",&n);

it store the value of at variable n;

now time to n number of array element using for loop upto n number of elements.

for(int i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

to read array element at address &a[i] upto n number of elements.

suppose value of n=5

then using for loop read value of array element usign for loop

56 78 2 45 1

now to arrange array element in increseing order using bubble sort we have to compare each element to the next element if a[i]>a[i+1]

swap to next

like 56 and 78

56>78 not so increment count and then compare a[1] and a[2]

ie 78 and 2 78>2 so swap the list and at the end of first pass on of the greatest element is sorted at the bottom of list.

56 2 45 1 78

and in second pass second gretest element i.e 56 is sorted at botom of list

2 45 1 56 78

and so on

1 2 45 56 78 at the and of pass n-1 list get sorted.

use nested for lop for comparision

for (i=0;i<n-1;i++)/*for n-1 passes*/

{

for(j=0;j<n-1;j++)

ifa[j]>a[j+1]

temp=a[j];

a[j]=a[j+1];

a[j=1]=temp;/*swaping logic*/

}

and after the end of this storted list is generated and with the help of for loop display the output

for(j=0;j<n;j++)

printf(" ",a[i]);

in this way bubble sort will be working and at the end of each pass one of the greatest element is sorted at the bottom of list and hence called as bubble sort.

and total n-1 passes are required to sort the list

where n indicate total number of element in list

in our example value of n=5

so n-1 ie 5-1=4

passes are required to sort the list .

and use for loop to read array element

and nested for loop to compare and swap element to generate sorted list

and for loop to display sorted array elements.