- 博客(9)
- 收藏
- 关注
RSS订阅原创 Strassen's algorithm to compute matrix multiplication
//// main.cpp// Strassen//// Created by Longxiang Lyu on 5/24/16.// Copyright (c) 2016 Longxiang Lyu. All rights reserved.//#include #include #include #include #include using namespa
2016-05-25 03:54:36
641
原创 Karatsuba algorithm C++ implementation
//// main.cpp// multiply//// Created by Longxiang Lyu on 5/23/16.// Copyright (c) 2016 Leo Lyu. All rights reserved.//// the karatsuba's algorithm only needs O(n^log3) bit operation to do t
2016-05-24 07:32:32
3104
原创 Randomized quicksort
#include #include #include #include using namespace std;// QuickSort(List A)// if A size <= 1// return// pick A[i] from A as pivot// (L, M, R) <- partition-3way(A, i)// QuickSort(List L)/
2016-05-22 10:36:56
740
原创 Binary Search Tree implementation
#include #include #include #include using namespace std;struct Node{ int data; struct Node *left = nullptr; struct Node *right = nullptr; Node() = default; Node(int d, Node *l, Node *r)
2016-05-21 13:50:01
513
原创 closest pair of points(O(nlogn)) solution
#include #include #include #include #include using namespace std;// point class representing point in 2D planestruct Point{ int x; int y; Point() = default; Point(int xx, int yy) : x(xx)
2016-05-20 12:20:25
581
原创 closest pair of points(O(n*logn*logn)) solution
#include #include #include #include #include using namespace std;// point class representing point in 2D planestruct Point{ int x; int y; Point() = default; Point(int xx, int yy) : x(xx)
2016-05-20 11:46:07
485
原创 Inversion count implemented with merge sort
// inversion definition: for an array, if i a[j]#include #include #include #include using namespace std;int min(int a, int b){ return a < b ? a : b;}int merge(vector &arry, int start
2016-05-20 05:26:53
408
原创 Merge Sort (O(nlogn))
#include #include #include #include using namespace std;int min(int a, int b){ return a < b ? a : b;}void merge(vector &arry, int start, int mid, int end, vector &backup){ int i =
2016-05-20 04:01:32
429
原创 MST implementation with Kruskal and Boruvka algorithm
用C++分别实现了Kruskal和Boruvka算法计算MST其中Kruskal算法中对边的排序用的heapsort#include #include #include using namespace std;struct Edge{ int src; int dest; int weight; Edge() = default; Edge(int s, int d
2016-05-18 11:11:05
745
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人