Time complexity, space complexity – informal definition. Asymptotic notation – what is it, why it is defined. Definition of the symbols O, Ω, o. Example of a simple algorithm and identifiction of its time and space complexity.
Array. Definition, basic parameters and properties. Operations on the array and their complexities. List (doubly and singly linked). Definition, basic parameters and properties. Operations on the list and their complexities.
Stack. Definition, basic parameters, properties and operations. Implemetation via array and singly linked list and the complexities of the basic operations. Queue. Definition, basic parameters, properties and operations. Implemetation via array and singly linked list and the complexities of the basic operations.
Bubble sort and Insertion sort. Properties and a description of the algorithms, time complexity.
Heapsort. Heap as a data structure and its properties. Representation of the heap via array. Properties and description of the a