Cason Konzer: CSC 575 Workshop 1 - Friendly Sort
Channel: Cason Konzer
Date: 30/01/2023

In this video we are tasked with sorting people based on their friendliness. The friendliness of an individual person is hidden from us but we are given a meetup function which can reveal their friendliness. As inputs we have a list of people and the meetup function. The meetup function takes as input 2 people and outputs if they get along. People can be either friendly to everybody or otherwise friendly to nobody. Only if two people are friendly to everybody will the meetup function return that they get along. 

We explain the loop invariants used in a proposed algorithm written in python, along with an analysis of temporal and spatial asymptotic complexity. In conclusion we provide two brief best and worst case examples. 

All related materials can be found at the following locations:

https://umich-my.sharepoint.com/:f:/g/personal/casonk_umich_edu/EtqLFGQpc6REmjXmrwATvgsBm2_5YP5BmIwHlNsdCIsSkw?e=ufEJwA

or 

https://drive.google.com/drive/folders/1jGFwkrPJtFuzBKKYkiXPAQZEeKZ2S8tR?usp=share_link

or 

https://github.com/casonk/CSC575-Algorithm_and_Complexity_Analysis/tree/main/WorkShop/WorkShop1