def string_permutation(s1,s2):
    """
    Edge case: If the strings are not the same length, they are not permutations of each other.
    Count the occurence of each individual character in each string.
    If the counts are the same, the strings are permutations of each other.

    Counts are stored in array of 128 size. This is an assumption that we are using ASCII characters. 
    The number of characters in ASCII is 128. 
    """
    if len(s1) != len(s2):
        return False

    count_s1 = [0] * 128
    for char in s1:
        count_s1[ord(char)] += 1

    count_s2 = [0] * 128
    for char in s2:
        count_s2[ord(char)] += 1
    
    if count_s1 == count_s2:
      return True
    else:
      return False