Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 2 additions & 15 deletions src/llm_benchmark/control/double.py
Original file line number Diff line number Diff line change
Expand Up @@ -4,20 +4,7 @@
class DoubleForLoop:
@staticmethod
def sum_square(n: int) -> int:
"""Sum of squares of numbers from 0 to n (exclusive)

Args:
n (int): Number to sum up to

Returns:
int: Sum of squares of numbers from 0 to n
"""
sum_ = 0
for i in range(n):
for j in range(n):
if i == j:
sum_ += i * j
return sum_
return sum(i * i for i in range(n))

@staticmethod
def sum_triangle(n: int) -> int:
Expand Down Expand Up @@ -90,4 +77,4 @@ def sum_matrix(m: List[List[int]]) -> int:
for i in range(len(m)):
for j in range(len(m[i])):
sum_ += m[i][j]
return sum_
return sum_
11 changes: 4 additions & 7 deletions src/llm_benchmark/control/single.py
Original file line number Diff line number Diff line change
Expand Up @@ -5,17 +5,14 @@ class SingleForLoop:
@staticmethod
def sum_range(n: int) -> int:
"""Sum of range of numbers from 0 to n

Args:
n (int): Number to sum up to

Returns:
int: Sum of range of numbers from 0 to n
"""
arr = []
for i in range(n):
arr.append(i)
return sum(arr)
return (n * (n + 1)) // 2

@staticmethod
def max_list(v: List[int]) -> int:
Expand Down Expand Up @@ -48,4 +45,4 @@ def sum_modulus(n: int, m: int) -> int:
for i in range(n):
if i % m == 0:
arr.append(i)
return sum(arr)
return sum(arr)