
A simple introduction
I’m a computer science student at Purdue University who does engineering as a hobby. I believe the best way to come up with an innovative and elegant solution to a problem is by having a vase amount of knowledge in the back of my head. This is why I love to make stuff; I say: making stuff is just like a box of chocolate, you never know when you learn something new. This reminds me one time I dropped a box full of screws with M2, M3, M4 … screws (with different length), nuts for those screws, and washers. And there are a lot of them, in fact about 600 pieces; it was a mess. I first swept them into one place than started sorting them. I initially started by picking one screw up, then putting it to the right slot int the screw box. It was super inefficient, M2 washer is really hard for a person who have short nails to pick up. I thought it will take me all day to sort out these screws; then I remembered, I learned the stuff I learned my Computer Science classes. I quickly identified the biggest bottleneck is me picking up and dropping off screws, so I want to do this the least often possible. Bucket sort is the algorithm I decided to use; I first sort the screws on the ground, grouping same type of screws in a pile, I don’t need to lift the screw up to do this. After sorting on the ground I picked up the pile by sliding a piece of paper under them and dripping them into their slot in the screw box. What started as a nightmare has ended up pretty fun, I never thought I would enjoy soring screws this much. And this is why I love to make stuff, you never know that you will learn this time.