270 lines
10 KiB
Markdown
270 lines
10 KiB
Markdown
# Coding Capabilities Test Results
|
|
|
|
## Highscores
|
|
|
|
### Performance Rankings (Duration)
|
|
|
|
| Test | Model | Duration (ms) | Duration (s) |
|
|
|------|-------|--------------|--------------|
|
|
| factorial_function | openrouter/quasar-alpha | 1401 | 1.40 |
|
|
| factorial_function | openai/gpt-3.5-turbo | 1769 | 1.77 |
|
|
| factorial_function | openai/gpt-4o-mini | 2126 | 2.13 |
|
|
| factorial_function | deepseek/deepseek-r1-distill-qwen-14b:free | 13297 | 13.30 |
|
|
| bubble_sort_function | openai/gpt-3.5-turbo | 1970 | 1.97 |
|
|
| bubble_sort_function | openrouter/quasar-alpha | 2427 | 2.43 |
|
|
| bubble_sort_function | openai/gpt-4o-mini | 5720 | 5.72 |
|
|
| bubble_sort_function | deepseek/deepseek-r1-distill-qwen-14b:free | 24839 | 24.84 |
|
|
|
|
## Summary
|
|
|
|
- Total Tests: 8
|
|
- Passed: 0
|
|
- Failed: 8
|
|
- Success Rate: 0.00%
|
|
- Average Duration: 6694ms (6.69s)
|
|
|
|
## 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: 1769ms (1.77s)
|
|
- 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/7/2025, 6:57:36 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) {
|
|
let result = 1;
|
|
for (let i = 2; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}`
|
|
- Duration: 13297ms (13.30s)
|
|
- Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) {
|
|
let result = 1;
|
|
for (let i = 2; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}
|
|
- Timestamp: 4/7/2025, 6:57:49 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) return undefined; // Factorial not defined for negative numbers
|
|
if (n === 0) return 1; // 0! is 1
|
|
let result = 1;
|
|
for (let i = 1; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}`
|
|
- Duration: 2126ms (2.13s)
|
|
- Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) {
|
|
if (n < 0) return undefined; // factorial not defined for negative numbers
|
|
if (n === 0) return 1; // 0! is 1
|
|
let result = 1;
|
|
for (let i = 1; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}
|
|
- Timestamp: 4/7/2025, 6:57:51 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) return undefined;
|
|
if (n === 0 || n === 1) return 1;
|
|
return n * factorial(n - 1);
|
|
}`
|
|
- Duration: 1401ms (1.40s)
|
|
- Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) {
|
|
if (n < 0) return undefined;
|
|
if (n === 0 || n === 1) return 1;
|
|
return n * factorial(n - 1);
|
|
}
|
|
- Timestamp: 4/7/2025, 6:57:53 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) {
|
|
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]) {
|
|
let temp = arr[j];
|
|
arr[j] = arr[j + 1];
|
|
arr[j + 1] = temp;
|
|
}
|
|
}
|
|
}
|
|
return arr;
|
|
}`
|
|
- Duration: 1970ms (1.97s)
|
|
- 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]) {
|
|
let temp = arr[j];
|
|
arr[j] = arr[j + 1];
|
|
arr[j + 1] = temp;
|
|
}
|
|
}
|
|
}
|
|
return arr;
|
|
}
|
|
- Timestamp: 4/7/2025, 6:57:55 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 swapped;
|
|
for (let i = arr.length; i > 0; i--) {
|
|
swapped = false;
|
|
for (let j = 0; j < i - 1; j++) {
|
|
if (arr[j] > arr[j + 1]) {
|
|
[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
|
|
swapped = true;
|
|
}
|
|
}
|
|
if (!swapped) break;
|
|
}
|
|
return arr;
|
|
}`
|
|
- Duration: 24839ms (24.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 swapped;
|
|
for (let i = arr.length; i > 0; i--) {
|
|
swapped = false;
|
|
for (let j = 0; j < i - 1; j++) {
|
|
if (arr[j] > arr[j + 1]) {
|
|
[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
|
|
swapped = true;
|
|
}
|
|
}
|
|
if (!swapped) break;
|
|
}
|
|
return arr;
|
|
}
|
|
- Timestamp: 4/7/2025, 6:58:19 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 - 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: 5720ms (5.72s)
|
|
- 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/7/2025, 6:58:25 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: 2427ms (2.43s)
|
|
- 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/7/2025, 6:58:28 PM
|
|
|
|
## Passed Tests
|
|
|
|
*No passed tests*
|
|
|