libchaos / learn-algorithm-365

You can write code for simple programs without formal knowledge of algorithms, But anything more complex than sample is going to be a problem. understanding of algorithm complexity can be very helpful. It can make the difference between things that run in a reasonable time and things that just lock up your computer and you don't know why.

#welcome to learn algorithm 365 with me ##log record

1. The relization of the skip-list that include the insert, search, delete methods. date: 2016-11-25 in Shanghai
2. The quick sort has benn come true. date: 2016-11-30 in shanghai
3. The insert sort has bee come true. date: 2016-11-30 in shanghai
4. The hash table has been come true. date: 2016-12-1 in shanghai
5. The heap sort and priority queue has been come true. date: 2016-12-4 in shanghai
6. The stack and queue has been come true. date: 2016-12-6 in shanghai
7. The real queue that is based on a circular slice has come true date: 2016-12-9 in shanghai
8. Fixed tiny bug in skip list but there are have some bug in random number date: 2016-12-9 in shanghai
9. The double list has been come true. date: 2016-12-12 in shanghai

how to test?

you can test specified file use below command

go test -v  yourfile.go youfile_test.go

##contact Wechat: converxy

QQ: 2698380951

Email: [e-mail]