diff --git a/search/exponential_search.cpp b/search/exponential_search.cpp index c8370580a..bd3671eda 100644 --- a/search/exponential_search.cpp +++ b/search/exponential_search.cpp @@ -12,14 +12,13 @@ * algorithm return null ponter, every other cases the algoritm return fom the * loop. */ -#include -#include -#include -#include /// for integral typedefs +#include // for assert +#include // for floor +#include // for int32_t, uint32_t #ifdef _MSC_VER #include // use for MS Visual C++ #else -#include // for all other compilers +#include // for size_t #endif /** Binary Search Algorithm (used by ::struzik_search)\n diff --git a/search/fibonacci_search.cpp b/search/fibonacci_search.cpp index be181a47d..d01fdbc03 100644 --- a/search/fibonacci_search.cpp +++ b/search/fibonacci_search.cpp @@ -5,11 +5,10 @@ * algorithm](https://en.wikipedia.org/wiki/Fibonacci_search_technique) */ -#include -#include // for std::vector class -#include // for assert -#include // for random numbers -#include // for sorting +#include // for vector +#include // for assert +#include // for rand +#include // for find, sort, min, remove diff --git a/search/hash_search.cpp b/search/hash_search.cpp index 6e4caffc3..905c72815 100644 --- a/search/hash_search.cpp +++ b/search/hash_search.cpp @@ -15,18 +15,14 @@ * @todo fix the program for memory leaks and better structure in C++ and not C * fashion */ -#include -#include +#include // for NULL, malloc +#include // for basic_ostream, operator<<, char_traits, basic_os... #define MAX 6 ///< Determines how much data #define HASHMAX 5 ///< Determines the length of the hash table int data[MAX] = {1, 10, 15, 5, 8, 7}; //!< test data -/** - * a one-way linked list - */ -typedef struct list { int key; //!< key value for node struct list* next; //!< pointer to next link in the chain } node, /**< define node as one item list */ diff --git a/search/saddleback_search.cpp b/search/saddleback_search.cpp index 4f2a5606d..12ce9c307 100644 --- a/search/saddleback_search.cpp +++ b/search/saddleback_search.cpp @@ -12,10 +12,10 @@ * * @author [Hashir Niazi](https://github.com/HashirGJ8842) */ -#include /// for assert -#include /// for integral typedefs -#include /// for io operations, and std::pair -#include /// for std::vector +#include // for assert +#include // for uint32_t, int32_t +#include // for vector +#include // for pair, make_pair, operator== /** \namespace search * \brief Algorithms for searching diff --git a/search/sublist_search.cpp b/search/sublist_search.cpp index 7b485f041..6058e643e 100644 --- a/search/sublist_search.cpp +++ b/search/sublist_search.cpp @@ -25,10 +25,11 @@ * @author [Nitin Sharma](https://github.com/foo290) */ -#include /// for assert -#include /// for integral typedefs -#include /// for IO operations -#include /// for std::vector +#include // for assert +#include // for NULL +#include // for uint64_t, uint32_t +#include // for basic_ostream, operator<<, cout, char_traits, endl +#include // for vector /** * @namespace search diff --git a/search/text_search.cpp b/search/text_search.cpp index 291b1df85..3e1140487 100644 --- a/search/text_search.cpp +++ b/search/text_search.cpp @@ -2,13 +2,13 @@ * \file * \brief Search for words in a long textual paragraph. */ -#include -#include -#include +#include // for tolower +#include // for assert +#include // for basic_ostream, operator<<, char_traits, cout, endl +#include // for basic_string, operator<<, string, getline #ifdef _MSC_VER -#include // required for MS Visual C++ +#include // for basic_string, operator<<, string, getline #else -#include #endif /**