#tips-and-tricks
Read more stories on Hashnode
Articles with this tag
Bubble_sort uses the technique of comparing and swapping def bubble_sort(lst): for passnum in range(len(lst) - 1, 0, -1): for i in...
On a very basic level, an insertion sort algorithm contains the logic of shifting around and inserting elements to sort an unordered list of any size....
Implements javascript's [].concat(...arr). Flattens the list(non-deep) and returns a list. def spread(arg): ret = [] for i in arg: if...
