# Write a computer program that prompts the user for one number, n for

Module 7 showed that one way of comparing different algorithms for accomplishing the same task is complexity analysis. You will recall that in complexity analysis we express the time an algorithm takes to run as a function of the size of the input, and we used the big-Oh notation. For example, if an algorithm has a complexity of O(1), then it always runs in the same amount of time, no matter what the size of the input is; if it O(n), then the time it takes for the algorithm to run is proportional to the size of the input. However, complexity analysis has a number of limitations. For example, big-Oh analysis concerns the worst case scenario. For example, some sorting algorithms with a complexity of O(n^2) often run considerably faster if the list that it receives as input is (almost) sorted; other sorting algorithms with a complexity of O(n^2) always take the same amount of time, no matter what state the list is in. Also, in big-Oh, we look at the dominant term in our calculation of the complexity of the algorithm. Thus, when we analyze an algorithm and discover that it runs in 75,312 + n time units, we still say that it has a complexity of O(n). It is therefore deemed to be better than an algorithm that runs in .007 + n^2 time units, as this algorithm has a complexity of O(n^2).

We also saw the rationale behind this: If n becomes sufficiently large, the other factors become insignificant. Fortunately, there is another way to determine how long it takes for an algorithm to run, namely timing experiments. In a timing experiment, you actually implement the algorithm in a programming language, such as Java or C++, and simply measure how long it takes for the algorithm to run. In the term project for this course, you are going to conduct a timing experiment and compare the results with the results you would get from a complexity analysis. We will compare Bubble Sort with Selection Sort. In its least sophisticated form, bubble sort (http://en.wikipedia.org/wiki/Bubble_sort) works as follows: Assuming that the list contains n elements. Compare the first and the second element in the list, and swap them if the last element is smaller than the preceding one; otherwise, do nothing to this pair. Now, compare the second and third elements and swap them if the first of them is larger than the second; otherwise, do nothing to this pair. Move on the next pair and continue the process until you reach the end of the list.

A little reflection will show that at the end of this iteration, the last element in the list is now the largest element in the list. The last element has bubbled to the top. Now repeat the process but rather than going to the end of the list, stop when you reach n-1. Now repeat the process again, but rather than going to the end of the list, stop when you reach n-2. Keep repeating this until you reach 1. The Wikipedia entry has a little simulation that shows how bubble sort works. The code looks something like: bubbleSort(array A){ n = length(A); for(j = n; j > 0, j–) for(i = 1; i < j; i++) { if A[i-1] > A[i] swap(A,i-1, i); } } } swap obviously swaps the elements and can be defined as: swap(A, pos1, pos2) { temp = A[pos1]; A[pos1] = A[pos2]; A[pos2] = temp; } Another sort is selection sort (http://en.wikipedia.org/wiki/Selection_sort). We saw selection sort in the question in the sub-module on how to determine the complexity of an algorithm. Array A contains n elements, the elements to be sorted. The algorithm starts at the first position in the array and looks through the array for the smallest element. Once it reaches the end of the array, it puts that element in the first cell of the array. It then restarts the whole process from the second position in the array, and continues until the entire array has been sorted. selection_sort(array A) { int i,j int iMin; for(j = 0; j < n; j++){ iMin = j; for ( i = j+1; i < n; i++) { if (a[i] < a[iMin]) { iMin = i; } } if ( iMin != j ) { swap(a[j], a[iMin]); } } }

#Write #computer #program #prompts #user #number

Pages (275 words)
Standard price: \$0.00

### Latest Reviews

Impressed with the sample above? Wait there is more

Related Questions

### The research project is a research-based paper on a current

The research project is a research-based paper on a current topic in the area of Cyberlaw, to be approved by your instructor. You will develop

### I will be using the Law of cosine a2=b2+c2-2bc*cos(deg) Example:

I will be using the Law of cosine a2=b2+c2-2bc*cos(deg)    Example: would be if a car in the dessert was traveling 4.3m one  way then

### Research Information Gathering?  Which is the BEST Method? Write a one

Research Information Gathering?  Which is the BEST Method? Write a one page reaction/opinion paper based on the topic listed below.  The due date for this

### Instructions Provide a written paper discussing the questions below. Use APA

Instructions Provide a written paper discussing the questions below. Use APA format for this paper. Keep your submissions concise, focused, and succinct. Page length:

### Strategic Marketing How attractive is your company in the field of competitors How has it entered the market and how

Strategic MarketingHow attractive is your company in the field of competitors? How has it entered the market and how is it positioned to capture a

### Sustainable Tourism and Indigenous Culture Topic Annotated

complete EIGHT(8) individual bibliographies and each annotated bibliography summary should be about 100 – 200 words per citation： 1.Du Pisani, Jacobus (2006) Sustainable development –

### discussion 1 De-motivated Daisy Imagine that you are Daisy’s manager.

discussion 1 De-motivated Daisy Imagine that you are Daisy’s manager. Daisy’s approach to her work is unorganized, and she has not completed a single assignment

### Final Project: Methods Section This week, you will create the

Final Project: Methods Section This week, you will create the Methodology section of your research proposal(topic : Social Psychology of Self-efficacy). In this section, you

### Hello. Please I need to do a PowerPoint project. Should

Hello. Please I need to do a PowerPoint project. Should be no less than 20 slides without counting the presentation and references, with illustrations and

### Make each paragraph 6 to 10 sentences. Discuss in view of historical perspective and current laws. What does it mean

Make each paragraph 6 to 10 sentences.Discuss in view of historical perspective and current laws. What does it mean to be “disabled”? What are employers’

### It is very important to read the lecture attached the

It is very important to read the lecture attached the risk performance because the risk matrix form needs to be included in the assignment

### Review the Resources and think about the national healthcare issue/stressor you previously selected

Quite often, nurse leaders are faced with ethical dilemmas, such as those associated with choices between competing needs and limited resources. Resources are finite, and

New questions