tailieunhanh - Lecture Discrete structures: Chapter 11 - Amer Rasheed

This chapter includes contents: Mathematical review; asymptotic and algorithm analysis; relationships and data structures; requential storage: Lists, queues, stacks, deques; hash tables; trees; priority queues and heaps; sort algorithms; graphs and graph algorithms; algorithm design techniques; complexity classes and NP completeness. |