---------- Forwarded message --------- From: kirby urner <kirby.ur...@gmail.com> Date: Wednesday, April 20, 2022 at 7:50:48 PM UTC-7 Subject: Re: exhibit: after class note to students, Silicon Forest elite school To: Trimtab Book Club <trimtab-book-c...@googlegroups.com>
A very similar letter to my recent one, why? I'm teaching two groups, this one entirely online. So what I test out with one group, I adjust for the next, leap frog fashion. I think it's worth sharing them both, to promote a stereoscopic view of the terrain. ======================== Thanks for tuning in to our biweekly "radio show" (like talk radio, but with pictures). Today our theme was algorithm speed, which is described using O-notation. "Polynomial time" O(n^2) for example, is only able to process about 5000 data elements in a second, rougly speaking. That's an approximation I cited from the USACO PDF I want you to have: https://usaco.guide/CPH.pdf That 300 page PDF has a healthy dose of what we call Discrete Math. It's what you will need to do well in CP (competitive programming). Sorting, finding shortest paths through a graph, or solving a subarray problem ("Kedanes algorithm" is part of the lore), have all been implemented for you. The USACO documentation counsels against trying to reinvent the wheel on the fly i.e. reinventing the best known algorithms. Rather, your job is to know which algorithm is called for, and then to make use of the relevant library, e.g. for sorting. My talk zoomed back, away from CP, to show more of the terrain: algorithms as used in the movie and simulations industries, data structures as tiles from a globe. I demonstrated a real time rendering of tensegrity structures, implemented by a world leader in the field, Gerald de Jong. Thanks to WebAssembly generated from Rust, your browser is able to show his creations involving in real time, not as a pre-recorded movie. Sometimes it's hard to tell the difference. https://pretenst.com/app/#construction;Triped https://pretenst.com/app/#construction;Halo-by-Crane Real materials (not CGI): https://pretenst.com/construct ion/2021/07/27/brass-bubble-120 <https://pretenst.com/construction/2021/07/27/brass-bubble-120> This is all still Algorithms and Data Structures. I ended with kennethsnelson.net. That's not the website I built for him, and for which he gave me Barrel Tower (showed on screen), but the one that came after, when he found the right paid professional. I was just doing it as a friend. Kenneth, an Oregonian (born and raised in Pendleton), was in inspiration for both Gerald and myself. Lastly, what some of you may of missed as I shared this early (as a loose end from last time): https://youtu.be/gFEE3w7F0ww Lex Fridman is a great interviewer and in this case his guest is a member of the Python community who has a lot to do with the tools I've been introducing (e.g. numpy and Anaconda). Kirby *Course Name*: Data Structure and Alg orithms in Python *Datetime*: 01/29-06/19 Wednesday,Sunday 6:00pm-7:00pm *Location*: Online10 Thanks, Sunshine Elite Education
_______________________________________________ Edu-sig mailing list -- edu-sig@python.org To unsubscribe send an email to edu-sig-le...@python.org https://mail.python.org/mailman3/lists/edu-sig.python.org/ Member address: arch...@mail-archive.com
