Skip to content

Conversation

@chamberi
Copy link
Owner

No description provided.

CCallahanIV and others added 30 commits January 16, 2017 12:44
…o bst

sdf building a binary search tree.
…ctures into traversal-bst

g
g Lines starting with '#' will be ignocquire post_order_trav. red, and an empty message aborts
README.MD Outdated

The assignment was to implement a [Weighted Graph](https://codefellows.github.io/sea-python-401d5/assignments/graph_3_weighted.html)
in Python containing the following methods:
Insertion Sort takes a list and re-orders it so that the items in the list are arranged lowest to highest.

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

A more detailed description would be nice -- all your sorting algorithms reorders and sorts the list, but what makes insertion sort unique?

"""


def insertion_sort(isl):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

isl is a strange name for this. Why did you pick it? Is there something that you could use that would be a bit more intuitive?


def insertion_sort(list):
"""Insertion sort method."""
for item in range(len(list)):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

list is a horrible variable name

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants