Scribd Logo
Upload

Welcome to Scribd!

  • CS345: Design and Analysis of Algorithms Spring 2014 Programming Assignment 1

    Uploaded by

    Chandramauli Singh
    6 views1 page
    This document is a programming assignment for an algorithms course. It describes an experiment that compares the runtime of O(n^2) and O(nlog(n)) algorithms. It lists the processor, RAM, and number of repetitions used for different input sizes n. It presents the largest values of n that each algorithm could process within 1 second, 10 seconds, and 1 minute.

    Original Description:

    Assinment

    Original Title

    Assign

    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
    This document is a programming assignment for an algorithms course. It describes an experiment that compares the runtime of O(n^2) and O(nlog(n)) algorithms. It lists the processor, RAM, and number of repetitions used for different input sizes n. It presents the largest values of n that each algorithm could process within 1 second, 10 seconds, and 1 minute.

    Copyright:

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

    CS345: Design and Analysis of Algorithms Spring 2014 Programming Assignment 1

    Uploaded by

    Chandramauli Singh
    This document is a programming assignment for an algorithms course. It describes an experiment that compares the runtime of O(n^2) and O(nlog(n)) algorithms. It lists the processor, RAM, and number of repetitions used for different input sizes n. It presents the largest values of n that each algorithm could process within 1 second, 10 seconds, and 1 minute.

    Copyright:

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

    CS345 : Design and Analysis of Algorithms

    Spring 2014
    Programming Assignment 1
    Bhupendra Kastore 11204
    Chandramauli Singh 11214
    Problem 2
    (a)
    Processor -Intel Core i5-2450M, 2.5GHz upto 3.1GHz
    RAM- 4GB
    For n< 5000, number of times execution was repeated 200 times
    For n>5000 and n<10000, number of times execution was repeated 100 times
    for n>10000, number of times execution was repeated 10 times
    (b) Comparison between O(n
    2
    ) and O(nlog(n)) algoritms
    (c) Largest values of N for the two algorithms for a runtime of 1sec, 10 sec and 1 min
    Time O(n
    2
    ) O(nlog(n))
    1 sec 7500 150000
    10 sec 25000 1200000
    1 min 750000 6400000
    *For O(nlog(n)) values were found by extrapolation
    1

    You might also like