Insert Position - Modern Fortran Programming

A sorted table can tell where a new value belongs by counting values below it.
Program

Play the program to change the score and see its insertion position.
                            score
                            score = 25 (default)score = 15score = 45
                        

                            insert_position.f90
                        
Replay: real traced execution (multi-file project)

                            program insert_position_demo
    implicit none
    integer :: sorted(4)
    integer :: score
    integer :: i
    integer :: position

    sorted = [10, 20, 30, 40]
    score = 25
    position = 1
    do i = 1, 4
        if (score > sorted(i)) position = i + 1
    end do
    print '(I0, 1X, I0)', score, position
end program insert_position_demo
program insert_position_demo
    implicit none
    integer :: sorted(4)
    integer :: score
    integer :: i
    integer :: position

    sorted = [10, 20, 30, 40]
    score = 15
    position = 1
    do i = 1, 4
        if (score > sorted(i)) position = i + 1
    end do
    print '(I0, 1X, I0)', score, position
end program insert_position_demo
program insert_position_demo
    implicit none
    integer :: sorted(4)
    integer :: score
    integer :: i
    integer :: position

    sorted = [10, 20, 30, 40]
    score = 45
    position = 1
    do i = 1, 4
        if (score > sorted(i)) position = i + 1
    end do
    print '(I0, 1X, I0)', score, position
end program insert_position_demo

                        
1sorted ← [10, 20, 30, 40]⋯8sorted = [10, 20, 30, 40]9score = 25⋯values this step[10, 20, 30, 40]sorted
2score ← 25⋯8sorted = [10, 20, 30, 40]9score = 2510position = 1⋯values this step25score
3position ← 1⋯9score = 2510position = 111do i = 1, 4⋯values this step1position
4i ← 1⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step1i
5position ← 2⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step2position.true.score > sorted(1)
6i ← 2⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step2i
7position ← 3⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step3position.true.score > sorted(2)
8i ← 3⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step3i
9if (score > sorted(i)) position = i + 1⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step.false.score > sorted(3)
10i ← 4⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step4i
11if (score > sorted(i)) position = i + 1⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step.false.score > sorted(4)
12print '(I0, 1X, I0)', score, position⋯13    end do14    print '(I0, 1X, I0)', score, position15end program insert_position_demooutput25 3values this step25score3position
1sorted ← [10, 20, 30, 40]⋯8sorted = [10, 20, 30, 40]9score = 15⋯values this step[10, 20, 30, 40]sorted
2score ← 15⋯8sorted = [10, 20, 30, 40]9score = 1510position = 1⋯values this step15score
3position ← 1⋯9score = 1510position = 111do i = 1, 4⋯values this step1position
4i ← 1⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step1i
5position ← 2⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step2position.true.score > sorted(1)
6i ← 2⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step2i
7if (score > sorted(i)) position = i + 1⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step.false.score > sorted(2)
8i ← 3⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step3i
9if (score > sorted(i)) position = i + 1⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step.false.score > sorted(3)
10i ← 4⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step4i
11if (score > sorted(i)) position = i + 1⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step.false.score > sorted(4)
12print '(I0, 1X, I0)', score, position⋯13    end do14    print '(I0, 1X, I0)', score, position15end program insert_position_demooutput15 2values this step15score2position
1sorted ← [10, 20, 30, 40]⋯8sorted = [10, 20, 30, 40]9score = 45⋯values this step[10, 20, 30, 40]sorted
2score ← 45⋯8sorted = [10, 20, 30, 40]9score = 4510position = 1⋯values this step45score
3position ← 1⋯9score = 4510position = 111do i = 1, 4⋯values this step1position
4i ← 1⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step1i
5position ← 2⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step2position.true.score > sorted(1)
6i ← 2⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step2i
7position ← 3⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step3position.true.score > sorted(2)
8i ← 3⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step3i
9position ← 4⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step4position.true.score > sorted(3)
10i ← 4⋯10position = 111do i = 1, 412    if (score > sorted(i)) position = i + 1⋯values this step4i
11position ← 5⋯11do i = 1, 412    if (score > sorted(i)) position = i + 113end do⋯values this step5position.true.score > sorted(4)
12print '(I0, 1X, I0)', score, position⋯13    end do14    print '(I0, 1X, I0)', score, position15end program insert_position_demooutput45 5values this step45score5position
sorted table The existing values are already ordered from low to high.
insertion position `position` advances once for every sorted value below `score`.
rank idea The final position is a rank-like answer for where the score belongs.