Unit 2.1 - Algorithms

Unit 2.1 - Algorithms

1. Computational Thinking

   • Computational Thinking is taking a complex problem, understanding the problem and coming up with possible solutions
   • We then present these solutions in a way that humans or computers can understand
   • Step 1 - Decomposition - Breaking down a complex problem into smaller more managebale parts
   • Step 2 - Abstraction - Ignoring irrelevant details and info
   • Step 3 - Pattern Recognition - Looking for similarities between current and old problems
   • Step 4 - Algorithms - Coming up with solutions to the problem

2. Algorithmic Thinking - Identifying steps involved in solving a problem

   • Linear Search - Each item in the list is checked in order - Not Sorted
     • Step 1 - Check the first value
     • Step 2 - IF it is the value you're looking for - celebrate and stop
     • Step 3 - ELSE move on & check the next value
     • Step 3 - Repeat until you have checked all variables
   • Binary Search - An ordered list is divided in 2 with each comparison - Sorted
     • Step 1 - Take the middle value, compare to value your looking for
     • Step 2 - IF it is the value you're looking for - celebrate & stop
     • Step 3 - ELIF it is larger than the one you're looking for, take the values to the left
     • Step 3 - ELIF it is smaller than the value you're looking for, take the values to the right
     • Step 4 - Repeat with the new list

3. Bubble Sorting

   • Step 1 - Take first two elements from list
   • Step 2 - Confirm them
   • Step 3 - IF element > Element 2, swap them. ELSE - Do nothing
   • Step 4 - Repeat: Move along the list to the next pair until you have made no changes to the list

4. Merging Lists

   • Step 1 - Split all elements into individual lists
   • Step 2 - Compare the first element in both lists
   • Step 3 - Put the smallest in the new list
   • Step 4 - Compare the next element of 1 list with the second element of the 2nd list
   • Step 5 - Put the smallest into a new list and repeat until merged

5. Insertion Sort - One sorted and one unsorted list

   • Step 1 - Compare the first element of the unsorted list to each element of the sorted list
   • Step 2 - If is smaller, put it in front of that element
   • Step 3 - ELIF it is larger, compare with the next
   • Step 4 - ELIF there are no more elements in the sorted list, put into final position
   • Step 5 - Repeat until all elements in the unsorted list are in the sorted list