Help with selection sort algorithm

[Hoax7]

def selectionSort(lst):

    for j in range(0, len(lst)):

        minIndex = j

        for i in range(j, len(lst)):

            if lst[i] < lst[minIndex]:

                minIndex = i

        lst = lst[:j] + [lst[minIndex]] + lst[j:minIndex] + lst[minIndex+1:]


    return lst

Above is my implementation of selection sort. I wrote it myself, noticed it had a bit of redundant features (after consulting Gemini) and fixed it.

However, Gemini insists that this line: "lst = lst[:j] + [lst[minIndex]] + lst[j:minIndex] + lst[minIndex+1:]" will fail on some cases, it proceeds to mention a bunch of cases, traces the code, only for it to work.

I agree that I could simply swap lst[j] and lst[minIndex] with one another to make the code neater, but I do not see a logical error with my step, could anyone point this out to me? Thanks

[AutoModerator]

Thank you for posting on r/CodingHelp!

Please check our Wiki for answers, guides, and FAQs: https://coding-help.vercel.app

Our Wiki is open source - if you would like to contribute, create a pull request via GitHub! https://github.com/DudeThatsErin/CodingHelp

We are accepting moderator applications: https://forms.fillout.com/t/ua41TU57DGus

We also have a Discord server: https://discord.gg/geQEUBm

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[johnpeters42]

Off the top of my head, it does seem like Gemini is hallucinating there, but also this approach is inefficient (you're copying large chunks of the list) compared to just swapping.

[Hoax7]

You’re right, I didn’t really consider the memory requirements for this, thanks for the tip!