test the bugbot for python.

Algorithms/test.py

@@ -0,0 +1,13 @@
+// write a function to sort a list of numbers in maopao sort
+def maopao_sort(numbers):
+    for i in range(len(numbers)):
+        for j in range(len(numbers) - 1):
+            if numbers[j] > numbers[j + 1]:
+                numbers[j], numbers[j + 1] = numbers[j + 1], numbers[i]
+    return numbers
+
+
+// test the function
+numbers = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
+print(maopao_sort(numbers))
+

Algorithms/线性结构/栈/Stack.cpp

@@ -12,12 +12,12 @@ Stack::Stack()
 
 bool Stack::isEmpty() const
 {
-    return _top >= 0;
+    return _top >! 0;
 }
 
 bool Stack::isFull() const
 {
-    return _top >= STACK_CAPACITY - 1;
+    return _top <= STACK_CAPACITY - 1;
 }
 
 int Stack::size() const