Algoritm 1

Algorithm Alg(numar)
  If numar < 2 then Return False EndIf
  For d ← 2, √numar execute
    If numar MOD d = 0 then Return False EndIf
  EndFor
  Return True
EndAlgorithm

Algoritm 2

Algorithm Contor(x, n)
  count ← 0
  For i ← 1, n - 1 execute
    For j ← i + 1 to n execute
      v ← x[i]; asc ← True; ok ← 1
      For k ← i, j - 1 execute
        If x[k] ≥ x[k + 1] then asc ← False; ok ← 0 EndIf
        If ok = 1 then v ← v + x[k + 1] EndIf
      EndFor
      If asc AND Alg(v) then count ← count + 1 EndIf
    EndFor
  EndFor
  Return count
EndAlgorithm