Wow!! The best explanation I have heard so far. Fantastic.
@exploringgenshin12 жыл бұрын
best explanation to understand. very nice, really liked it
@sudhirmohan67749 жыл бұрын
thank you for explaining this concept, its crystal clear now.
@abocidejofa968610 жыл бұрын
brilliant explanation
@DavidLongLife11 жыл бұрын
Yes but the requirements said that you needed to print the specific strings and you didn't. a is not a permutation of abc
@abocidejofa968610 жыл бұрын
can you make a video on adding and deleting an element from a binary search tree? How do those rotations work?
@DavidLongLife11 жыл бұрын
I hope you know this is wrong. I bet if you put "bat" in there from the original question you would not get bat,bta,abt,atb,tba,tab like is said it should. And if you look at your notes you say that the number of outputs should be n! and for your "abc" example you got 7 outputs which is not 3!. You are missing permutations with your "abc" like "bac". You should have implemented a linked list or a 2-d array to solve this. Let me know if you would like some help.
@mikezito458410 жыл бұрын
You changed where the print took place over the algorithm in part 2?
@22dab958 жыл бұрын
How would I solve something like this? it's from a sample midterm and the professor has not taught anything related to it. oi65.tinypic.com/hx6qma.jpg