Consider the difference between explaining the gist of quick-sort and actually writing a production implementation. The first is very quick and can be done in 5 minutes while the second can easily take you months. We will firmly plant ourselves in the first category and look at the basic ideas behind some non-trivial SIMD (i.e. vectorized) algorithms. The plan is to at least cover strcmp, set_intersect and sort but I hope to squize in a few more. The talk does not expect you to know anything but some CS101 algorithms. After the talk, hopefully, SIMD will not seem such a mysterious art.