
    Design a learning progression algorithm that calculates a student's weighted advancement score through n difficulty levels, where each level's contribution is the reciprocal of its position in the sequence. The algorithm should process n-1 levels to determine the cumulative learning progress, helping educators assess the student's readiness for the nth (final) difficulty tier.
    

    
def harmonic_sum(n):
    """
    Design a learning progression algorithm that calculates a student's weighted advancement score through n difficulty levels, where each level's contribution is the reciprocal of its position in the sequence. The algorithm should process n-1 levels to determine the cumulative learning progress, helping educators assess the student's readiness for the nth (final) difficulty tier.
    

    """
def harmonic_sum(n):
    """
    Design a learning progression algorithm that calculates a student's weighted advancement score through n difficulty levels, where each level's contribution is the reciprocal of its position in the sequence. The algorithm should process n-1 levels to determine the cumulative learning progress, helping educators assess the student's readiness for the nth (final) difficulty tier.
    

    """
    if n < 2:
        return 1
    else:
        return 1 / n + harmonic_sum(n - 1)