Krononberg

#include using namespace std; int binary_search(int arr[], int size, int target){ int left = 0; int right = size - 1; while (left

#include using namespace std; int partition(int arr[], int low, int high){ int pivot = arr[high]; int i = low - 1; for (int j = low; j < high; j++){ if (arr[j] < pivot){ i++; swap(arr[i], arr[j]); } } swap(arr[i + 1], arr[high]); return (i + 1); } void quick_sort(int arr[], int low, int high){ if (low < high) { //pi = pivotindex int pi = partition(arr, low, high); quick_sort(arr, low, pi - 1); q..

#include #include #include using namespace std; class Graph{ int V; list*adj; public: Graph(int V); ~Graph(); void add_line(int from, int to); void bfs(int start); }; Graph::Graph(int V){ this->V = V; adj = new list[V]; } Graph::~Graph(){ delete[] adj; } void Graph::add_line(int from, int to){ adj[from].push_back(to); } void Graph::bfs(int start){ bool *visited = new bool[V]{false}; visited[star..