吐槽下天猫 app

[czheo]

首页向左滑向右滑用户看来根本是鸡肋。这算 ABtest ？两个页面看不出啥大差别，根本无所谓。不知道的用户还会纳闷下。
为了 metrics driven 而硬做 ABtest 和为了 test driven 而破坏代码结构一样，都是本末倒置。

[czheo]

``` python
def quick_sort(numbers,left,right):
if right - left <= 0:
return numbers

tmp = numbers[left]
i = left + 1
j = right

while i < j:
while numbers[j] > tmp and i < j:
j -= 1
while numbers[i] <= tmp and i < j:
i += 1
numbers[i], numbers[j] = numbers[j], numbers[i]

if numbers[i] > numbers[left]:
numbers[i-1], numbers[left] = numbers[left], numbers[i-1]
else:
numbers[i], numbers[left] = numbers[left], numbers[i]

quick_sort(numbers,left,i-1)
quick_sort(numbers,i+1,right)

return numbers

test = [3,7,8,5,1,2,2,2,22,11,5,4]
print(quick_sort(test, 0, len(test) - 1))
```

[czheo]

```
def quick_sort(numbers,left,right):
if right - left <= 0:
return numbers

tmp = numbers[left]
i = left + 1
j = right

while i < j:
while numbers[j] > tmp and i < j:
j -= 1
while numbers[i] <= tmp and i < j:
i += 1
numbers[i], numbers[j] = numbers[j], numbers[i]

if numbers[i] > numbers[left]:
numbers[i-1], numbers[left] = numbers[left], numbers[i-1]
else:
numbers[i], numbers[left] = numbers[left], numbers[i]

quick_sort(numbers,left,i-1)
quick_sort(numbers,i+1,right)

return numbers

test = [3,7,8,5,1,2,2,2,22,11,5,4]
print(quick_sort(test, 0, len(test) - 1))
```

[czheo]

～～～
def quick_sort(numbers,left,right):
if right - left <= 0:
return numbers

tmp = numbers[left]
i = left + 1
j = right

while i < j:
while numbers[j] > tmp and i < j:
j -= 1
while numbers[i] <= tmp and i < j:
i += 1
numbers[i], numbers[j] = numbers[j], numbers[i]

if numbers[i] > numbers[left]:
numbers[i-1], numbers[left] = numbers[left], numbers[i-1]
else:
numbers[i], numbers[left] = numbers[left], numbers[i]

quick_sort(numbers,left,i-1)
quick_sort(numbers,i+1,right)

return numbers

test = [3,7,8,5,1,2,2,2,22,11,5,4]
print(quick_sort(test, 0, len(test) - 1))
～～～

[czheo]

~~~
def quick_sort(numbers,left,right):
if right - left <= 0:
return numbers

tmp = numbers[left]
i = left + 1
j = right

while i < j:
while numbers[j] > tmp and i < j:
j -= 1
while numbers[i] <= tmp and i < j:
i += 1
numbers[i], numbers[j] = numbers[j], numbers[i]

if numbers[i] > numbers[left]:
numbers[i-1], numbers[left] = numbers[left], numbers[i-1]
else:
numbers[i], numbers[left] = numbers[left], numbers[i]

quick_sort(numbers,left,i-1)
quick_sort(numbers,i+1,right)

return numbers

test = [3,7,8,5,1,2,2,2,22,11,5,4]
print(quick_sort(test, 0, len(test) - 1))
~~~