The Self-Taught Computer Scientist

Index

• A
• abstract data type, 84, 87, 127, 163
• acyclic graph, 174, 187
• add_adj method, 179
• add_edge method, 180
• add_vertex method, 179
• adjacency list, 177, 187
• adjacent vertices, 176, 187
• algorithm
  • analyzing of, 4–8
  • average-case complexity of, 15
  • best-case complexity of, 15
  • big O notation within, 7, 10, 11, 13–14, 15, 17
  • binary search of, 27–32, 34
  • brute-force, 14
  • constant time complexity of, 8–9
  • cubic time complexity of, 13–14
  • defined, 3, 17
  • exponential time of, 14–15
  • iterative, 19
  • linear search, 25–26
  • linear time of, 10
  • logarithmic time of, 9
  • log-linear time of, 11
  • polynomial time of, 14
  • quadratic time of, 11–13
  • run time of, 4–5
  • search, 25
  • sorting, 53–54
  • space complexity of, 15–16
  • steps within, 5–7
  • tortoise-and-the-hare, 110–111
  • worst-case complexity of, 15

• American Standard Code for Information Interchange (ASCII), 32–33, 35
• anagram, 55–56, 61
• AND operator, 69
• an_iterable parameter, 96
• append method, 105, 107, 116, 118
• application programming interface (API), 141, 145
• array
  • associative, 137, 144
  • combining two lists within, 94–95
  • within computer memory, 89
  • creating, 90–91
  • defined, 87, 99
  • finding duplicates within a list, 95–97
  • finding the intersection of lists within, 98–99
  • heterogeneous, 89, 100
  • heterogeneous variable-length, 87, 100
  • moving zeros within, 91–94
  • multidimensional, 88, 100
  • within Numerical Python (NumPy) package, 90
  • one-dimensional, 88, 100
  • overallocation of, 90
  • performance of, 88–90
  • run time of, 88–89
  • as static data structure, 85
  • storage example of, ...