随笔分类 -  book comments

上一页 1 2
CLRS:master theory in complexity of algorithm
摘要：T(n)=aT(n/b)+f(n); where we can interpret n/b to mean either floor(b/n) or ceil(b/n), Then T (n) has the following asymptotic bounds: 1. If f (n)= O(n 阅读全文
posted @ 2016-05-05 15:07 zeroArn 阅读(178) 评论(0) 推荐(0)
CLRS:Max_sunsequence_sum O(n*n) O(nlgn) O(n)
摘要：#include<stdio.h>#include<stdlib.h>#include<time.h>#define ARRAY_SIZE 1000int buf [ARRAY_SIZE];int main(){ srand((unsigned int )time(0)); int i,j,n; w 阅读全文
posted @ 2016-05-04 17:02 zeroArn 阅读(170) 评论(0) 推荐(0)
CLRS:Insert sort in in c
摘要：#include<stdio.h>#include<string.h>#include<stdlib.h>#include<time.h>#define ARRAY_SIZE 1000int buf[ARRAY_SIZE];int main(){ int i,j,n; srand((unsigned 阅读全文
posted @ 2016-05-03 20:59 zeroArn 阅读(106) 评论(0) 推荐(0)
The difference between macro and function I/Ofunction comparision(from c and pointer )
摘要：macro is typeless and execute faster than funtion ,becaus of the overhead of calling and returnning of function,but macro will increase the size of pr 阅读全文
posted @ 2016-05-02 11:45 zeroArn 阅读(173) 评论(0) 推荐(0)
a mystrious max subquence sum
摘要：#include<cstdio>#include<cstring>const int maxn=100005;int buf[maxn];int main(){ freopen("input.txt","r",stdin); memset(buf,0,sizeof(buf)); int i,j,k, 阅读全文
posted @ 2016-03-24 21:53 zeroArn 阅读(194) 评论(0) 推荐(0)
max subquence sum(n^2)
摘要：#include<cstdio>#include<cstring>const int maxn=100005;int buf[maxn];int main(){ freopen("input.txt","r",stdin); memset(buf,0,sizeof(buf)); int i,j,k, 阅读全文
posted @ 2016-03-24 21:28 zeroArn 阅读(259) 评论(0) 推荐(0)

上一页 1 2