For this project (C++), you may use any existing sorting program you found. In t

Question

For this project (C++), you may use any existing sorting program you found. In that case, however, you must indicate where you obtain the sorting program that you use. For example, page 160 in the book “Introduction to Algorithms” by CLRS, 3e. You may also provide a URL if you use a sorting algorithm downloaded from that URL.

Example from Page 160:

Write a program to solve the selection problem. Let k = N/ 2. Draw a table showing the running time of your program for various values of N .

HEAPSORT (A) 1 BUILD-MAX-HEAP (A) 2 for i A length downto 2 3 exchange All] with Ali A. heap-size A heap-size 1 5 MAX-HEAPIFY (A, 1)

Explanation / Answer

Hi Please find below code which i have written in java its same logic except syntex.

public static void main(String[] args) { int N[] = {5,7,3,4,8,10}; int[] S = null; int i = 0; int prev = 0; while (i < N.length) { if (N[i] < prev) { S[prev] = N[i]; } else { N[i] = S[i]; } prev = N[i]; i++; System.out.println(prev); } for (int j = 0; j < N.length; j++) { System.out.print(S[j] + ","); } }

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.