Scribd Logo
Upload

Welcome to Scribd!

  • Assignment #1 Deadline: Wednesday, September 27, 2017 Before 8:30 AM (To Be Delivered in My Hands)

    Uploaded by

    Chris Yu
    0 views1 page
    The document provides instructions for Assignment #1 that is due on September 27th before 8:30 AM. It must be submitted in hard copy and have readable handwriting. The assignment consists of two problems. The first problem involves unfolding a recurrence relation with a formula involving n and deriving an exact solution. The second problem involves designing an algorithm in plain English that takes an array as input and finds the minimum positive difference between any two elements in O(n log(n)) time.

    Original Description:

    Questions

    Original Title

    A1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for Assignment #1 that is due on September 27th before 8:30 AM. It must be submitted in hard copy and have readable handwriting. The assignment consists of two problems. The first problem involves unfolding a recurrence relation with a formula involving n and deriving an exact solution. The second problem involves designing an algorithm in plain English that takes an array as input and finds the minimum positive difference between any two elements in O(n log(n)) time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    0 views1 page

    Assignment #1 Deadline: Wednesday, September 27, 2017 Before 8:30 AM (To Be Delivered in My Hands)

    Uploaded by

    Chris Yu
    The document provides instructions for Assignment #1 that is due on September 27th before 8:30 AM. It must be submitted in hard copy and have readable handwriting. The assignment consists of two problems. The first problem involves unfolding a recurrence relation with a formula involving n and deriving an exact solution. The second problem involves designing an algorithm in plain English that takes an array as input and finds the minimum positive difference between any two elements in O(n log(n)) time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    CSI - 3105 Design & Analysis of Algorithms

    Fall 2017
    Assignment #1
    Deadline: Wednesday, September 27, 2017
    before 8:30 AM (to be delivered in my hands)
    Note: Make sure your handwriting is readable, otherwise your assignment
    will not be marked.

    1. (10 marks) Assume that n = 8k , where k is a positive integer, and solve the following
    recurrence by unfolding.
    (
    1 if n = 1,
    T (n) = 1
    
    4 T 8 n + 2017 if n 2.

    Your final answer must be an exact formula in terms of n. Your final answer must be
    simplified as much as possible. Your must provide all details of your solution.

    2. (10 marks) Design an algorithm to solve the following problem.

    input: An array A[1..n] of n different numbers.


    output: Two different indices i and j such that A[j] A[i] > 0 and A[j] A[i] is
    minimum.

    Your algorithm must take O(n log(n)) time. You must describe your algorithm in plain
    English and you must explain why the running time of your algorithm is O(n log(n)).

    You might also like