Assignment No. 02
SEMESTER Fall 2019
CS502- Fundamentals of Algorithms
Assignment diagram:
Note:
Your answer must follow the below-given specifications.
• Font style: “Times New Roman”
• Font color: “Black”
• Font size: “12”
• Bold for heading only.
• Font in Italic is not allowed at all.
• No formatting or bullets are allowed to use.
• Your answer should be precise and to the point, avoid irrelevant detail.
Lectures Covered: This assignment covers Lecture # 09 - 14
Deadline
Last Date: Your assignment must be uploaded/submitted at or before 27/11/2019.
Consider the given diagram having an unsorted array and its sorting procedure through dry run. You are required to answer the following questions.
Question No 01: (Marks: 5)
You are required to determine (write down the name) the algorithm being used while sorting the above-given array.
Question No 02: (Marks: 7)
You are required to design (write) the algorithm (Only Pseudocode) determined in Question 1.
Question No 03: (Marks: 8)
You are required to calculate (Step by Step) the worst-case time complexity T(n) of the algorithm designed in Question No. 02.
Download
0 Comments