search algorithms:
- Linear search C ++
- Binary (binary) search for c++
- Interpolates search C ++
- Sieve of Eratosthenes C ++ (video)
- Search substring in string C ++
sorting algorithms:
- Selection sorting c ++ (video)
- Bubble Sort C ++ (video)
- Shaker sorting c ++
- Sorting inserts C ++ (video)
- A binary tree in C ++(video)
Very often, the programmer need to quickly find any data or values in arrays, or sort an array by some parameters (descending or ascending, for example). Can, of course, and most think and sketch out code, that will work.
But believe me – almost everything has already been invented before you. Furthermore– all known search and sorting algorithms many times enhanced and optimized, both for efficiency and speed. Do not invent a bicycle. Look, what has been done to you. On this page of our site contains the most popular sorting algorithms in C ++ and algorithms of search data arrays.
I understand these algorithms, you will not be difficult to sort an array, or to find the necessary data in the array.
Algorithms for sorting and searching algorithms – it is quite different classes of problems. And in each class and a lot of their algorithms, and methods, and technical methods.
To clearly see the commonality in each class, It was very helpful to divide everything into two distinct categories “Search” and “sorting” (how 2 different pages, subpages, subtree … how convenient).
And later these categories (subtrees) can not become 2, and 3, 4 and so on.
Will quicksort be parsed? (Hoare sort)?