def binarySearch(lst, value,low,high):          #low,high是lst的查找范围
    if high < low:
        return -1
    mid = (low + high)/2
    if lst[mid] > value:
        return binarySearch(lst, value, low, mid-1)
    elif lst[mid] < value:
        return binarySearch(lst, value, mid+1, high)
    else:
        return mid

>>> def odd_even(l):
...     return [i for i in l if (~i&1)] + [j for j in l if (j&1)]

#! /usr/bin/env python

print "Please input a name:"
snake_case = raw_input()
camelCase = []
for ch in snake_case.split("_"):
    camelCase.append(ch.title())
print "".join(camelCase)

def qsort(L):
    return (qsort([y for y in L[1:] if y <  L[0]]) +
                  L[:1] + 
                  [y for y in L[1:] if y == L[0] + qsort([y for y in L[1:] if y > L[0]]) ) \
                  if len(L) > 1 else L

from whoosh.qparser import QueryParser
with ix.searcher() as searcher:
    query = QueryParser("content",ix.schema).parse("second")
    result = searcher.search(query)
    results[0]