Implement the Selection Sort Algorithm - Implement the Selection Sort Algorithm

Code Feedback
1

Tell us what’s happening:

Hello,
I have a question :
Can i use min() Method or should i create my own method?
Thanks in advance.

Your code so far

def selection_sort(list_items) -> list:
    length = len(list_items)
    sort_index = 0
    while sort_index < length:
        selected_list = list_items[sort_index:]
        minimum_element = min(selected_list)
        minimum_element_index = selected_list.index(minimum_element)
        swapping_element = selected_list[sort_index - sort_index]
        if minimum_element == swapping_element:
            sort_index += 1
            continue
        list_items[sort_index] = minimum_element
        list_items[minimum_element_index + sort_index] = swapping_element
        #print(f'minimum element: {minimum_element} and his index: {minimum_element_index}\n swapping element: {swapping_element} and his index: {sort_index}')
        #print(list_items)
        sort_index += 1

    #print('done')
    return list_items 

print(selection_sort([33, 1, 89, 2, 67, 245]))         
print(selection_sort([5, 16, 99, 12, 567, 23, 15, 72, 3]))
print(selection_sort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]))
#print(selection_sort([1,55,7,1,2,55]))

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/146.0.0.0 Safari/537.36 Edg/146.0.0.0

Challenge Information:

Implement the Selection Sort Algorithm - Implement the Selection Sort Algorithm

2

Hi @majdhd,

We have changed the category of this topic to “Code Feedback” and blurred this solution (with [spoiler][/spoiler] tags) so that users who have not completed this challenge can read the discussion in this thread without giving away the solution.

Happy coding!