




def    __SCREAMING_SNAKE_CASE				(					lowercase_   ,       lowercase_   ,       lowercase_ )    ->		float:

    """simple docstring"""


    __UpperCamelCase											=  [1 / first_term]
    __UpperCamelCase											=  1 / first_term
    for _ in range(number_of_terms - 1 ):
        first_term += common_difference
        arithmetic_progression.append(lowercase_ )
    __UpperCamelCase											=  [1 / step for step in arithmetic_progression]
    return sum(lowercase_ )


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 print(sum_of_harmonic_progression(1 / 2, 2, 2))












def    __SCREAMING_SNAKE_CASE				(					lowercase_ )    ->		list:

    """simple docstring"""


    __UpperCamelCase											=  len(lowercase_ )

    # Set the gap value to be decreased by a factor of 1.3
    # after each iteration
    __UpperCamelCase											=  1.3

    # Continue sorting until the gap is 1
    while gap > 1:
        # Decrease the gap value
        __UpperCamelCase											=  int(gap / shrink )

        # Sort the elements using insertion sort
        for i in range(lowercase_   ,       len(lowercase_ ) ):
            __UpperCamelCase											=  collection[i]
            __UpperCamelCase											=  i
            while j >= gap and collection[j - gap] > temp:
                __UpperCamelCase											=  collection[j - gap]
                j -= gap
            __UpperCamelCase											=  temp

    return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()






