Commits

Show all
Author Commit Message Labels Comments Date
Eric Chen
nothing
Branches
dev
Eric Chen
pass all tests. Remember that the files to open are not located in "./"
Eric Chen
Merge with dev
Eric Chen
nothing, just delete useless printf()
Branches
dev
Eric Chen
(1)nothing, just change the input file name to testLong.txt
Branches
dev
Eric Chen
(1)the version with all helper functions and printf(), fprintf() on. (2)the most original working version. (3)disable all helper functions and all printf(), fprintf()/ (4)nothing
Branches
dev
Eric Chen
(1)this version is more flexible in memory allocation. (2)this version preallocates memory for 100000 nodes, and dfsPrint() was implemented to assist printUnion(). Additionally, a different struct type was implemented to be used in dfsPrint(). (3)this python program can generate commands automatically(but takes hours to generate 100000 commands). (4)test case 1 that I wrote manually. (5)test case 2 that I wrote manually. (6),(7) nothing
Branches
dev
Eric Chen
Add some solutions.
Branches
dev
Eric Chen
Add sol to projectEuler prob1,2.
Branches
dev
Eric Chen
merge new doc in to branch dev
Branches
dev
Eric Chen
Add some sol to ch4
Branches
docdev
Eric Chen
Add solution to some exercises in introToAlg 3ed. But the correctness is questionable beca I wrote the sol in haste.
Branches
docdev
Eric Chen
merged into default
Eric Chen
Strip original changesets and recommit to avoid violating Honor code of Stanford online alg class.
Branches
dev
Eric Chen
Fin Ex_Fibonacci_Closure.go practice. Make a new file directory.
Branches
dev
Eric Chen
Add license info at the beginning of src code. Nothing else.
Branches
dev
Eric Chen
Learning Golang. Here are some answers to exercises of "A Tour Of Go".
Eric Chen
just change copy right statement, nothing relates to code.
Eric Chen
just put ex4_1_3_timing test into ex4_1_3Py.py, and add matplotlib
Eric Chen
nothing just enable grid when saving to png
Eric Chen
add matplotlib fig to indicate that ex4_1_5_maxsubarr is truly O(n) while the recursive algorithm is truly O(n*lg n). But damn I don't know how to use legend in matplotlib so I just use text now XD
Eric Chen
change src folder structure, nothing new added.
Eric Chen
ex4_4_5_max_subarr.py now works correctly in both condition, when inputArr is normal(contains both pos and neg) or contains only negative elements. ToDo: Gonna plot out the time complexity of maxSubLinearPy() to prove that it's linear. So far maxSubLinearPy() does seems much faster than recursive algorithm when inputArr is large.
Eric Chen
not fin, I think the basic concept in x>=0 is correct, but need to check the correctness of where I wrote posElementsSumLeftToLeftmostNegElementInCurrMaxArr and posRightAfterNegSum. Also, I haven't checked the code in x<0 carefully.
Eric Chen
fin ex4.1-3
Eric Chen
testing Mecurial with multiple repo
Eric Chen
working on ex4_1_3Cython.pyx(not fin) to further test the result obtained in ex4_1_3_timing.py
Eric Chen
The 1st 2 exercises in ch4 of introduction to algorithm