Skip to content

Instantly share code, notes, and snippets.

@harrisonmalone

harrisonmalone/edgelist_and_sorting_discrete_maths.md

Created November 10, 2018 02:30
Show Gist options
  • Save harrisonmalone/66e9d4a3ea198a39c6e6a510a4c9c60a to your computer and use it in GitHub Desktop.
Save harrisonmalone/66e9d4a3ea198a39c6e6a510a4c9c60a to your computer and use it in GitHub Desktop.
Download ZIP
Raw
edgelist_and_sorting_discrete_maths.md

Edgelist and sorting

discrete maths today

worst case is n / 2 for linear search, binary search means sorting and then going higher or lower at each point, it's worst case is log n

then did edgelist

[AB, CA, AC]

going to different points in the shortest distance, might be how google maps figures out the shortest path

need to do more on edgelist stuff as my brain was pretty fried yesterday

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment