This post will be extremely stupid and cringey. This is your final warning. Hi there! I am Che-kai, and I want to tell you about a very bad algorithm I designed. I am not proud of it, and I don’t want anyone to use it, because it is both inefficient…

Why hello there. … … … … … … … … Wait. Why are you still here? … … … … Greedy for more words? … … … … I guess so. Well, that is today’s subject: the greedy algorithm. Seriously though, I have no idea why I am writing…

Did I misspell the title? Hehe. No. Today, our subject is A*! Yay! Hooray! Now to the 0 viewers out there: I am going to explain it! In a video! Isn’t that just great! Also check out a similar algorithm: https://chekailiang.medium.com/python-algorithm-pt-9-dijkstra-ea23635be325 Also bellman ford: https://chekailiang.medium.com/bellman-ford-df66f6932b4b Excuse me? I still need…

Me: “Hello Mr. Ford, can you tell us about yourself?” Bellman Ford: “Sure. I am a python algorithm who finds the shortest route to a certain destination, much like Dijkstra.” Me: “Alright then. To the Medium viewers here: Bellman Ford is NOT a person. It does sound like someone’s name…

I bet ya’ 49$ you can not say its name first try. DIJKSTRA. Try again. DIJKSTRA. Still can not get it right? Do I care? Hmm. No. Do you care? Do I care if you care? Hmm. No. Let’s get right into it. Also, don’t forget my 49$. Dijkstra is…

I think you all now why we are here. ANOTHER PYTHON ALGORITHM POST. SERIOUSLY. Why are you guys so interested in this god damn topic? Huh? ANSWER ME NERDS! WHY ARE YOU MAKING WRITE ANOTHER ONE OF THESE — *Sorry, we are encountering technical issues, please stand by~* *Sigh.* Hello…

Why hello there. Why are you still here? Oh, right, you came here for more BFS? Ok? What about no? Fine. I hate you. def is_exit(node): #Define if node == 'K': #node return True def bfs(graph, start): global visited queue = [start]#queue while queue: node = queue.pop(0) if is_exit(node): print(node…

BFS searches for a variable in a table we give the code. Formatted like the binary tree, the BFS is a good way to search for a wanted variable. HOW IT WORKS: The BFS searches from the first parent: Derp. Afterwards, in this examples, it starts from the left to…

Yay! Its Python Algorithm time…again! I have no idea why I am celebrating! Alright. What is heap tree? It is a type of…lets say…sort. It is quite similar to binary tree. The heap tree is quite an important knowledge in python. I will now post an example: class Heaptree(): def…