From Netease Openings.
Lecture 1: Introduction
What is algorithm study about.
Insertion sort: n cube
Merge sort: n log n
Lecture 2: Mathmatic
Asymptotic notation
Big O notation
Big omg
From Netease Openings.
Lecture 1: Introduction
What is algorithm study about.
Insertion sort: n cube
Merge sort: n log n
Lecture 2: Mathmatic
Asymptotic notation
Big O notation
Big omg