The 'state machine' family of lock-free algorithms.

Slack's Keith Adams, Chief Architect favourites Superlinear time, and the analysis (by Bob Tarjan) blows my mind. TheĬode is amazingly simple, the data structure operations take just barely Rank and path compression (Section 21.3 in the third edition of CLRS). The simple tree-based data structure for disjoint-set union, using union by It's not an algorithm, but a data structure. Of algorithms (search for 'algorithm' across the article) - Hackers on Knuth's books

Euclid's Algorithm features in this list.

Stackoverflow TCS (Theoretical Computer Science) How do I go about finding algorithms to get inspired by? Visit any of the

Choose whatever format makes sense to you to present all the above three.

Show the code for the algorithm either in pseudo code or your favourite.

Choose at least one real-world application that the algorithm finds useįor.

All that matters, why are you passionate about theĪlgorithm and what about it is so fascinating from your perspective?

Personality of the presentation - there is no right or wrong in yourĬhoice of algorithm.

IMPORTANT: Bonus points for adopting PechaKucha format, and sticking to 400 Presentation must motivate and inspire your peers and students to adopt anĪlgorithm of their choice and be inspired to make a presentation which is as OBJECTIVE: To tell the world why you as a CSE faculty care aboutĪlgorithms, which is the bedrock of Computer Science.

the style and content of the presenter and his presentation.

the interestingness and entertainment value of the real world application.

The faculty presentation will be scored on

Of course, for the real world use case, they might want to target a more mature audience. The key thing is ELi5 -> 'Explain Like I am 5' applies to the part of explaining the algorithm.

This document can also be accessed through Faculty ELi5 Algorithm Teaching (FEAT) challenge #FEAT UPDATE 2

Research computing dartmouth stata mp