mono/packages/kbot/tests/unit/reports/coding.md

Coding Capabilities Test Results

Highscores

Performance Rankings (Duration)

Test	Model	Duration (ms)	Duration (s)
factorial_function	openai/gpt-4o-mini	1158	1.16
factorial_function	openrouter/quasar-alpha	1229	1.23
factorial_function	openai/gpt-3.5-turbo	1514	1.51
factorial_function	deepseek/deepseek-r1-distill-qwen-14b:free	8463	8.46
bubble_sort_function	openai/gpt-3.5-turbo	1375	1.38
bubble_sort_function	openrouter/quasar-alpha	1841	1.84
bubble_sort_function	openai/gpt-4o-mini	2474	2.47
bubble_sort_function	deepseek/deepseek-r1-distill-qwen-14b:free	17999	18.00

Summary

• Total Tests: 8
• Passed: 0
• Failed: 8
• Success Rate: 0.00%
• Average Duration: 4507ms (4.51s)

Failed Tests

factorial_function - openai/gpt-3.5-turbo

• Prompt: Generate a JavaScript function that calculates the factorial of a number. The function should be named 'factorial' and take one parameter 'n'. Return only the function code, no explanation.
• Expected: function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }
• Actual: function factorial(n) { if (n === 0 || n === 1) { return 1; } else { return n * factorial(n - 1); } }
• Duration: 1514ms (1.51s)
• Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) { if (n === 0 || n === 1) { return 1; } else { return n * factorial(n - 1); } }
• Timestamp: 4/6/2025, 4:34:15 PM

factorial_function - deepseek/deepseek-r1-distill-qwen-14b:free

• Prompt: Generate a JavaScript function that calculates the factorial of a number. The function should be named 'factorial' and take one parameter 'n'. Return only the function code, no explanation.
• Expected: function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }
• Actual: function factorial(n) { if (n <= 1) return 1; let result = 1; for (let i = 2; i <= n; i++) { result *= i; } return result; }
• Duration: 8463ms (8.46s)
• Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) { if (n <= 1) return 1; let result = 1; for (let i = 2; i <= n; i++) { result *= i; } return result; }
• Timestamp: 4/6/2025, 4:34:23 PM

factorial_function - openai/gpt-4o-mini

• Prompt: Generate a JavaScript function that calculates the factorial of a number. The function should be named 'factorial' and take one parameter 'n'. Return only the function code, no explanation.
• Expected: function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }
• Actual: function factorial(n) { if (n === 0 || n === 1) return 1; return n * factorial(n - 1); }
• Duration: 1158ms (1.16s)
• Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) { if (n === 0 || n === 1) return 1; return n * factorial(n - 1); }
• Timestamp: 4/6/2025, 4:34:24 PM

factorial_function - openrouter/quasar-alpha

• Prompt: Generate a JavaScript function that calculates the factorial of a number. The function should be named 'factorial' and take one parameter 'n'. Return only the function code, no explanation.
• Expected: function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }
• Actual: function factorial(n) { if (n === 0 || n === 1) { return 1; } return n * factorial(n - 1); }
• Duration: 1229ms (1.23s)
• Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) { if (n === 0 || n === 1) { return 1; } return n * factorial(n - 1); }
• Timestamp: 4/6/2025, 4:34:26 PM

bubble_sort_function - openai/gpt-3.5-turbo

• Prompt: Generate a JavaScript function that implements bubble sort. The function should be named 'bubbleSort' and take one parameter 'arr' (an array of numbers). The function should return the sorted array. Return only the function code, no explanation.
• Expected: function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }
• Actual: function bubbleSort(arr) { var len = arr.length; for (var i = 0; i < len; i++) { for (var j = 0; j < len - i - 1; j++) { if (arr[j] > arr[j + 1]) { var temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }
• Duration: 1375ms (1.38s)
• Reason: Expected function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }, but got function bubblesort(arr) { var len = arr.length; for (var i = 0; i < len; i++) { for (var j = 0; j < len - i - 1; j++) { if (arr[j] > arr[j + 1]) { var temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }
• Timestamp: 4/6/2025, 4:34:27 PM

bubble_sort_function - deepseek/deepseek-r1-distill-qwen-14b:free

• Prompt: Generate a JavaScript function that implements bubble sort. The function should be named 'bubbleSort' and take one parameter 'arr' (an array of numbers). The function should return the sorted array. Return only the function code, no explanation.
• Expected: function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }
• Actual: function bubbleSort(arr) { let sortedArr = arr.slice(); let n = sortedArr.length; for (let i = 0; i < n; i++) { let swapped = false; for (let j = 0; j < n - 1 - i; j++) { if (sortedArr[j] > sortedArr[j + 1]) { let temp = sortedArr[j]; sortedArr[j] = sortedArr[j + 1]; sortedArr[j + 1] = temp; swapped = true; } } if (!swapped) break; } return sortedArr; }
• Duration: 17999ms (18.00s)
• Reason: Expected function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }, but got function bubblesort(arr) { let sortedarr = arr.slice(); let n = sortedarr.length; for (let i = 0; i < n; i++) { let swapped = false; for (let j = 0; j < n - 1 - i; j++) { if (sortedarr[j] > sortedarr[j + 1]) { let temp = sortedarr[j]; sortedarr[j] = sortedarr[j + 1]; sortedarr[j + 1] = temp; swapped = true; } } if (!swapped) break; } return sortedarr; }
• Timestamp: 4/6/2025, 4:34:45 PM

bubble_sort_function - openai/gpt-4o-mini

• Prompt: Generate a JavaScript function that implements bubble sort. The function should be named 'bubbleSort' and take one parameter 'arr' (an array of numbers). The function should return the sorted array. Return only the function code, no explanation.
• Expected: function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }
• Actual: function bubbleSort(arr) { let n = arr.length; for (let i = 0; i < n - 1; i++) { for (let j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]; } } } return arr; }
• Duration: 2474ms (2.47s)
• Reason: Expected function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }, but got function bubblesort(arr) { let n = arr.length; for (let i = 0; i < n - 1; i++) { for (let j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]; } } } return arr; }
• Timestamp: 4/6/2025, 4:34:47 PM

bubble_sort_function - openrouter/quasar-alpha

• Prompt: Generate a JavaScript function that implements bubble sort. The function should be named 'bubbleSort' and take one parameter 'arr' (an array of numbers). The function should return the sorted array. Return only the function code, no explanation.
• Expected: function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }
• Actual: function bubbleSort(arr) { let n = arr.length; for (let i = 0; i < n - 1; i++) { for (let j = 0; j < n - 1 - i; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }
• Duration: 1841ms (1.84s)
• Reason: Expected function bubbleSort(arr) { const n = arr.length; for(let i = 0; i < n; i++) { for(let j = 0; j < n-i-1; j++) { if(arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; } } } return arr; }, but got function bubblesort(arr) { let n = arr.length; for (let i = 0; i < n - 1; i++) { for (let j = 0; j < n - 1 - i; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }
• Timestamp: 4/6/2025, 4:34:49 PM

Passed Tests

No passed tests