Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

2016年5月7日

摘要: We don't have to keep a complete chess board.. just counters! 阅读全文
posted @ 2016-05-07 14:05 Tonix 阅读(300) 评论(0) 推荐(0)

摘要: Two tricks here: 1. Counting no. of inversed pairs - using Merge Sort, nothing special 2. How to check 'chaotic'? We simply check if any number is ove 阅读全文
posted @ 2016-05-07 13:30 Tonix 阅读(601) 评论(0) 推荐(0)