12 2011 档案

摘要：1.Searching an Element in a Rotated Sorted Arrayint r_binary_search(int arr[], int size, int key){ int left = 0; int right = size - 1; int mid; while(left <= right) { mid = (left + right)/2; if(arr[mid] == key) return mid; if(arr[mid] >= arr[left]) ... 阅读全文

摘要：资料：http://blog.csdn.net/liuben/article/details/50506971. 简单的方法：unsigned int simple_hash(char *str) { register unsigned int hash; register unsigned char *p; for(hash = 0, p = (unsigned char *)str; *p ; p++) hash = 31 * hash + *p; return (hash & 0x7FFFFFFF); } 阅读全文