# Author: Morrison
#  Date created: 1 Oct 2021
#  Date last modified: 1 Oct 2021
#  Program: algore.py
# #################### Problem 1 ###########################
def swap(x, j, k):
    if j != k:
        x[j],x[k] = x[k], x[j]
def adjacent_neighbors(x):
    """prec x is a homogeneous list of sortable items
    postc:  x is sorted in-place using the adjacent neighbors 
    algorithm"""
    pass
def trickle_down(x):
    """prec x is a homogeneous list of sortable items
    postc:  x is sorted in-place using the trickle down
    algorithm"""
    pass
# 
def number_name(n):
    """prec: n is a number  1 <= n < 1000000000000 (one trillion)
    postc:  returns a string with the number's name written
    out.  Exaples
    55 -> fifty five
    1,432,673 -> one millon four hundred thirty two thousand
    six hundred and seventy three"""
    return ""