emailconfirmed
1,824
edits
recap braiding
No edit summary |
(recap braiding) |
||
| Line 134: | Line 134: | ||
== Braids == | == Braids == | ||
In this class we | In this class we identified the basic elements of braids, and explored the intersection of braiding and sorting algorithms. | ||
=== Communication game === | |||
* We developed and discussed different notations for braiding | |||
* We played a game involving three persons | |||
** The first person creates a braid | |||
** The second person describes the structure or construction of the braid using words only | |||
** The third person recreates the braids accordingly | |||
==== Observations ==== | |||
* There are different ways to describe the structure of a braid | |||
** structure vs construction | |||
** position-based vs thread-based | |||
* Some instructions will not result in a braid | |||
* Some systems are simpler than others, but may not be universal in the sense that they can describe every possible braid | |||
=== Sorting Braids === | |||
* We discussed why sorting is an important topic in computer science | |||
* We got to know the concept of computational complexity and the big-o notation | |||
* We re-enacted several sorting algorithms using threads and chalk | |||
* We developed collaborative sorting algorithms resulting in braids | |||
==== Observations ==== | |||
* Bubblesort is a fun collaborative activity | |||
* The mapping from sorting operations to operations of textile construction is important | |||
* If the mapping is bad the result may not be a stable (overs and unders) | |||
* If the mapping is bad the result may not be dense (no-ops vs crossings) | |||
* Sorting networks allow for parallel sorting / braiding | |||
=== Links === | === Links === | ||