Simay Güzel

``` def test_my_enumerate(input_list, expected): result = my_enumerate(input_list) if result == expected: return True else: return False def my_enumerate(input_list): result = [] position = 0 for item in input_list: new_list =...

``` def my_reversed(input_list): if input_list(items,expected): result = my_reversed(input_list) return True else: return False def my_reversed(input_list) : [] def my_reversed(input_list) : return input_list[::-1] print(my_reversed([1,3,5])) output = [5,3,1] True ```

``` def linear_search(input_list, value): for position, item in enumerate(input_list): if item == "The Sandman": return position list_of_books = ["Coraline", "American Gods", "The Graveyard Book", "Good Omens", "Neverwhere"] print(linear_search(list_of_books, "The Sandman"))...

@hizkie and I found a solution after 2 days of working. Our solution works for all probable pivot_positions. ``` def test_partition(input_list, start, end, pivot_position,expected): result = partition(input_list, start, end, pivot_position)...

``` #I wrote this algorithm for exercise #2 def F(n): if (n == 0) : return 0 if (n == 1 or n== 2) : return 1 else: return F(n-1)+F(n-2)...

``` hobbitset = set({"Frodo", "Sam", "Pippin", "Merry"}) hobbitmagician = set({"Saruman", "Gandalf"}) mydict = dict() mydict['hobbits'] = hobbitset mydict['magicians'] = hobbitmagician for each in hobbitset: mydict['hobbits'].update for each in hobbitmagician: mydict['magicians'].update...

``` def test_exponentiation(n,e, expected): result = exponentiation(n,e) if expected == result: return True else: return False def exponentiation(n, e): if e==0: return 1 elif e==1: return n else: return n...

``` def test_merge_sort(input_list, expected): result = merge_sort(input_list) if result == expected: return True else: return False def merge_sort(input_list): input_list_len = len(input_list) if len(input_list) 0 and len(r) > 0: left_item =...

``` def test_output_stack(input_list, expected): result = output_stack(input_list) if expected == result: return True else: return False from collections import deque def output_stack(input_list): output_stack = deque() for item in input_list: output_stack.append(item)...

``` def test_multiplication(a, b, dic, expected): result = multiplication(a, b, dic) if result == expected: return True else: return False def multiplication(a, b, dic=dict()): if b not in dic: if...