• minimize http requests
• use a CDN
• utilize browser caching
• prioritize visible content (loading resources for visible then using JS to load remaining)
• lazy loading
• use sprites (collection of images put in a single img)
• concat and minify files

• Optimize images
• browser caching
• compression
• optimize and minimize CSS
• place JS files at bottom of page

set of attributes that define ways to make web pages more accessible to users with disabilities

• Query language for APIs and a runtime for filling those queries with your existing data.
• queries define how data is recieved
• Get many resources in a single request
• typesystem

• Cross origin resource sharing
• restricts request from a different domain than the domain from which the first asset was served

worst case complexity  O(n²)

best O(n)

avg O(n²)

iterates through array swapping values arr[i] & arr[i+1] until list is sorted

best/worst/avg O(n²)

each loop removes one element and adds to sorted portion of array

divide and conquer

O(nlogn)

1. continuously divide the list until you have N sublists, where each sublist has one unsorted element, and N is the number of elemnts in the array
2. Merge the lists together, 2 at a time to produce new sorted sublists, until all elements have been merged into a single sorted array

divide and conquer

O(nlogn)

1. continuously divide the list until you have N sublists, where each sublist has one unsorted element, and N is the number of elemnts in the array
2. Merge the lists together, 2 at a time to produce new sorted sublists, until all elements have been merged into a single sorted array