Solutions of Theory of Algorithms assignment 8.23

Solutions of Theory of Algorithms assignment 8.23 - But in...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 5 Exercise 8.2-3 The for- loop is used to navigate the whole array we want to sort. It doesn't matter whether we begin navigating the array from its first element to the last or from the last to the first. The algorithm will still work properly.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: But in this case the algorithm will not be stable, because the first repeated element appears in the array will be the last one in the sorted array. So, the order of the repeated elements will be reversed and not reserved....
View Full Document

Ask a homework question - tutors are online