Algorithms with Python
An algorithm is the list of instructions and rules that a computer needs to do to complete a task
List of data structures you can consult here:
-
chapter-four
absolute_difference.py recursive_insertion_sort.py sorted_loglinear.py -
chapter-one
adjacency_lists.py adjacency_matrix.py binary_tree.py black_box_list.py sorted_list.py straightforward_adjacency_set_representation.py timeit.py tree_with_lists_of_lists.py weight_matrix_with_inifinite_weight.py -
chapter-two
gnomesort.py is_prime.py merge_sort.py recursion.py -
exercises-chapter2
exercise_01.py recursion.py
Black Box List Example
class Node:
def __init__(self, value, next=None):
self.value = value
self.next = next
L = Node("a", Node("b", Node("c", Node("d"))))
print(L.value)
print(L.next.value)
print(L.next.next.value)
print(L.next.next.next.value)
