- 博客(4)
- 收藏
- 关注
RSS订阅转载 Minimum Cut - C++
#include #include #include #include #include #include namespace std { };using namespace std; class karger_graph{public: void set(size_t r, size_t c, size_t d) { _data[(r * _rc) +
2014-01-17 02:31:37
598
转载 QuickSort - C++
#include #include #include #include using namespace std;void quickSort(int a[], int n);int parti(int a[], int pivot, int end) ;int main(){ int a[10] = {3, 8, 5, 2, 7, 4, 6, 1, 9, -1};// par
2014-01-15 05:21:07
368
转载 Closest Pair of Points - C++
#include #include #include #include // A structure to represent a Point in 2D planestruct Point{ int x, y;}; /* Following two functions are needed for library function qsort(). Refer
2014-01-13 12:19:02
969
原创 Count Reverse Pairs - C++
#include #include using namespace std;int rev(int a[], const int low, const int high);int reverse_helper(int a[], const int low, const int mid, const int high);int main(){ int b[5] = {7, 3, 5
2014-01-13 11:28:26
490
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人