How Look Up Tables (LUTs) make your code Smaller, Faster, and Better (example in C)

Patreon ➤   / jacobsorber  
Courses ➤ https://jacobsorber.thinkific.com
Website ➤ https://www.jacobsorber.com
---


How Lookup Tables make your code Smaller, Faster, and Better (example in C) // What's a LUT? It's a data structure — really just an array used a certain way. The idea is simple, but often overlooked. This video tutorial provides a concrete example in C that I hope gets you on your way to producing faster, cleaner, easier-to-maintain code with Lookup Tables!




***

Welcome! I post videos that help you learn to program and become a more confident software developer. I cover beginner-to-advanced systems topics ranging from network programming, threads, processes, operating systems, embedded systems and others. My goal is to help you get under-the-hood and better understand how computers work and how you can use them to become stronger students and more capable professional developers.


About me: I'm a computer scientist, electrical engineer, researcher, and teacher. I specialize in embedded systems, mobile computing, sensor networks, and the Internet of Things. I teach systems and networking courses at Clemson University, where I also lead the PERSIST research lab.

More about me and what I do:
https://www.jacobsorber.com
https://people.cs.clemson.edu/~jsorber/
http://persist.cs.clemson.edu/

To Support the Channel:
like, subscribe, spread the word
contribute via Patreon --- [  / jacobsorber  ]

Source code is also available to Patreon supporters. --- [https://jsorber-youtube-source.heroku...]