Running Time of Selection Sort

Reply to Thread

Discussion in 'Homework Help' started by zulfi100, Jan 19, 2016.

Reply to Thread
  1. Jan 19, 2016 #1
    zulfi100

    Thread Starter Active Member

    Jun 7, 2012
    464
    1
    upload_2016-1-19_23-12-7.png
    Hi,
    In the above image, I cant understand why the running time of inner loop is n*(n-1)/2? I am able to understand n* (n-1) but I cant understand why are we dividing by 2? Can some body please guide me.

    Zulfi.
     
    #1 Reply
  2. Jan 20, 2016 #2
    zulfi100

    Thread Starter Active Member

    Jun 7, 2012
    464
    1
    Hi,
    I am able to understand this. Actually the formula for sum of numbers from 1 to n is : ( n * (n+1))/ 2.

    Zulfi.
     
    #2 Reply
Loading...
Related Forum Posts:
  1. asilvester635

    Recurrence for the running time of a recursive version of insertion sort

    Posted by asilvester635 in forum: Homework Help
    Replies:
    7
    Views:
    285
  2. zulfi100

    Running time of Computing Fibonacci series using Formula

    Posted by zulfi100 in forum: Homework Help
    Replies:
    2
    Views:
    420
  3. zulfi100

    Running Time of Insertion Sort

    Posted by zulfi100 in forum: Homework Help
    Replies:
    0
    Views:
    273
  4. WBahn

    Captcha workaround -- sort of

    Posted by WBahn in forum: Feedback and Suggestions
    Replies:
    5
    Views:
    1,509
  5. zulfi100

    Time for Q-sort

    Posted by zulfi100 in forum: Homework Help
    Replies:
    13
    Views:
    1,657
You May Also Like:

  1. LED Control for Automotive Applications: A 3-Channel Constant-Current Linear LED Controller from TI

  2. A Builder's Guide to Buying Electronics on eBay

  3. Texas Instruments Releases Family of Ultra-Small Gate Drivers (and Accompanying Power FETs)


Load More Articles