Question

23 30 35 43 4 10 22 4 Complete the following: a) Use the bubble sort...

23

30

35

43

4

10

22

4

Complete the following:

a) Use the bubble sort to sort the values showing the order of the values in the list after every pass of the sorting algorithm.  

b) What is the time complexity of the sort (use the number of comparisons required as a measure of time.)   

c) Modify the algorithm so it stops if there are no swaps in a complete pass. How many comparisons would be needed in your specific example?

d) Choose one of the following properties of Algorithms and show that the bubble sort has the given property:

  • Input: an algorithm has input values;
  • Output: from each set of input values an algorithm produces output values that are a solution to the problem;
  • Definiteness: the steps in an algorithm must be precisely defined;
  • Correctness: an algorithm must produce the correct output values for each set of input values;
  • Finiteness: an algorithm should produce the output after a finite number of steps;
  • Effectiveness: it must be possible to perform each step in the algorithm in a finite amount of time;
  • Generality: the algorithm must be applicable to a category of problems, not a single set of input values.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT