Basic concepts of complexity (space and time complexities, amortized complexity). Searching and sorting in main memory. Bubblesort, Heapsort and analysis of its complexity, Quicksort and analysis of its complexity, sorting in secondary memory. Structured data types, array, record, file, heaps and queues, priority queues, lists, trees. Linear Median algorithm. Dictionary problem, Implicit data structures, Binary search, Interpolation-searching. Binary Interpolation-search. Interpolation-search for unknown non uniform distributions. Dynamic implicit data structures, explicit data structures. Balanced trees: AVL-tree, Red-Black Tree or BB- tree, BB[α] tree, (a,b)-trees. Hybrid data structures, Tries, dynamic Interpolation search, interpolation search tree (IST), interpolation search tree searching. Union-find, Hashing, Hashing with chaining, Οpen addressing, Extendible Hashing, Secondary memory indexing. Persistent data structures, data structures in the RAM model of computation (Van Emde Boas tree and indexing structures for large word sizes).