Python - All Possible Permutations w/ Recursion

preview_player
Показать описание
I explain how to create a function to return all possible permutations of any given string.
Рекомендации по теме
Комментарии
Автор

Struggling many years to understand this, finally gotcha your video and u made my day bro

user_at
Автор

Dude thank you for that simple explanation "2nd function call, first recursive call." I have been trying to wrap my mind around how code like this works but you really simplified it

alasdairmacintyre
Автор

Thank a lot, especially for visualizing the execution of the code. It made me fully understand the solution. I have struggled with permutations and have seen a couple of other explanations/solutions, but yours is the only one that walked through the execution in detail and thus made me really understand the code.

Mullemeck
Автор

Dude, I seriously cannot thank you enough for this video. I was struggling with the idea of recursion and you filled in the gaps in my knowledge. Thanks a million

crowsnsuch
Автор

i struggled so much to understand permutation and this video is so far the best. detailed explanation! awesome and thank you so much

yiqiongxiao
Автор

this solution deserves a like ..best explanation

harshsaxena
Автор

This video deserves more views! You nailed it!!!

MuratJumashev
Автор

you're a life saver. Thank you for making this video

Strawlocka
Автор

banged head hundred times to understand this..thank u for making it so simple

vivekshinde
Автор

Your solution rocks my friend
... returns love from India...

opinions
Автор

best video explanation of recursion, bro deserves a W👍

kevinyuan
Автор

Love it, due to u with visual explanation, i comprehend now

hoanghuynh
Автор

Saw you in that Rabbit getting scared by its own

Now your subscriber

victor.novorski
Автор

Your explanation was the best! Thank you so much. I haave been stuck on this for so long.

AlI-xyjx
Автор

Trust me man you just nailed this i was trying for long to get being from non-Cs background it was difficult to digest but hats off to you

fardeendingankar
Автор

This is best available code and explaination i guess

mrKnown
Автор

Tnank you! It was very helpful explanation how it works

tigranhayrapetyan
Автор

Damn, I was so close to the answer. I just couldn't write the whole thing in any correct order. I had the base case, I knew I needed a loop somewhere with perm[:i] + char + perm[i:] and I knew I needed the function to call itself but I just could'nt put it all together >< so frustrating. Your solution makes perfect sense but I don't know if I could ever get that to all come out of my head the correct way. It seems so complicated, building a list, doing the permutations, going through the list to add more complex permutations...

CrushOfSiel
Автор

Perfect explaination, you sit, take a bow

amitupadhyay
Автор

Thanks for the video. I've been racking my brain on this for a few days because i was under the impression that the return needed to be the function call...

My brain kept coming back to having the recursive call go into a variable, but thought it wasn't allowed in a recursive function. Turns out i failed because i was too strict about what i thought the "rules" were... lol

Here's an updoot and a sub :P

TutonicKnight
welcome to shbcf.ru