Python

Selection Sort using recursion

Please support our Python advertiser: Programming Forums - DaniWeb Sister Site

Thread Solved

•

Join Date: Jul 2008

Posts: 12

Reputation: docaholic is an unknown quantity at this point

Solved Threads: 1

docaholic

Offline

Newbie Poster

Selection Sort using recursion

Mar 22nd, 2009

Help with Code Tags

(Toggle Plain Text)

def selsort(l):
 

    if len(l)<=1:
        return l
    else:
        for i in range(len(l)):
            selsort(l[1:])

Hey guys, this is what I have so far. I have trouble understanding recursion. Anyone know how to use it to do selection sort?

•

Join Date: Mar 2009

Posts: 51

Reputation: Dhaneshnm is an unknown quantity at this point

Solved Threads: 6

Dhaneshnm

Offline

Junior Poster in Training

Re: Selection Sort using recursion

Mar 23rd, 2009

you just have to modify else part a little
1.assign the result of recursive call to your list(l)
2.u r using the for loop to find smallest number in the list right?so put the above assignment out of the loop.
3.swap the smallest element with the first element of the list.

happy coding