Содержание
- 2. Algorithms Algorithms derives from name of Central Asian scientist Al-Khorezmi. Algorithm is a step-by-step set of
- 3. Searching
- 4. Linear search In plain English, Linear Search algorithm is as follows: Check if the first item
- 5. Binary search Binary Search is a very powerful algorithm. If you had 1000 presents to search
- 6. Binary Search (pseudo code) Look at the item in the centre of the list and compare
- 7. Binary Search vs Linear Search We have 1000 elements
- 8. Sorting Very important area of computer programming
- 9. Bubble sort
- 10. Selection sort The selection sort algorithm can be described as follows: Find the smallest item in
- 11. Insertion sort Insertion sort can be described with informal instructions as follows: Take an item from
- 12. Quicksort Quicksort can be described in the following way: Choose an item from the list and
- 13. Time and Space complexity Every algorithm uses some space and spends some time to solve problem
- 14. Best, worst and average Any algorithm has its own best, worst and average case For example:
- 15. Data structures We need to store some data, so that it can be: fastly find needed
- 16. Array or list Simplest data structure, saving it in memory sequence Finding n-th element is done
- 17. LinkedList LinkedList each element is connected with next element by link So finding n-th element takes
- 18. HashSet Searching by Hash takes 1 operation
- 19. Stack, Queue
- 20. Trees, Black-White trees
- 21. HashSet and TreeSet
- 23. Скачать презентацию