forked from Sissuire/Grokking-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
GrokkingAlgorithms.h
67 lines (59 loc) · 2.12 KB
/
GrokkingAlgorithms.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#ifndef GROKKING_ALGORITHM_H_
#define GROKKING_ALGORITHM_H_
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <map>
#include <set>
class GrokkingAlgorithm
{
public:
GrokkingAlgorithm();
~GrokkingAlgorithm();
void runDemoChapter_1();
void runDemoChapter_2();
void runDemoChapter_3();
void runDemoChapter_4();
void runDemoChapter_5();
void runDemoChapter_6();
void runDemoChapter_7();
void runDemoChapter_8();
void runDemoChapter_9();
private:
int Pesquisa_Binaria_Ch1(const int *lista, int tamanho, int item);
int InBinarySearch(const int *array, int pos1, int pos2, int val);
void SelectionSort_Ch2(std::list<int> lst, std::list<int> &sortedLst);
int Recursion_Ch3(int val);
int MaxSquare_Ch4(int w, int h);
int Sum_Ch4(int *array, int num);
void QuickSort_Ch4(int *array, int num);
void MergeSort_Ch4(int *array, int num);
void Merge(int *array, int num, int pos);
void HashTable_Ch5(std::map<std::string, int> &mapping);
std::pair<bool, std::string> BreadthFirstSearch_Ch6(std::map<std::string, std::vector<std::string>> &relationNet, std::set<std::string> &seller);
std::pair<std::vector<std::string>, int> Dijkstra_Ch7(std::map<std::string, std::map<std::string, int>> &graph);
std::map<std::string, int>::iterator find_lowest_cose_node(std::map < std::string, int> &cost, std::map<std::string, int> &counter);
std::set<std::string> GreedyAlgorithm_Ch8(std::set<std::string> &states_needed, std::map<std::string, std::set<std::string>> &stations);
std::pair<int, std::set<std::string>> KnapsackProblem_Ch9(std::map<std::string, std::pair<int, int>> &info, int wt);
std::pair<int, std::string> LongestCommonSubstring_Ch9(std::string str1, std::string str2);
int LongestCommonSubsequence_Ch9(std::string str1, std::string str2);
};
template<typename T> void PrintData(const T &data)
{
auto iter = data.begin();
while (iter != data.end())
std::cout << *iter++ << ", ";
std::cout << std::endl;
return;
}
template<typename T> void PrintData(T *data, int num)
{
int cnt = 0;
for (; cnt != num; cnt++)
std::cout << data[cnt] << ", ";
std::cout << std::endl;
return;
}
#endif