Today we reviewed about data structures in Python, comparing sorting algorithm and then start to learn about searching algorithm.
We started with a simple code to search one element out a list
and then find the position
then we learned about simple caesar cipher because we want to do frequency analysis to implement our new skill about dictionary and searching
we started the frequency analysis code with a simple code to count occurrence of an element in a list and also learn how to use a dictionary
and we need to sort it
we have found way to count each distinct element of a list with associative array a.k.a dictionary
this is the homework 😉 we’re going to finish the frequency analysis code next week before we explore more about tree and graphs 🙂