272 lines
10 KiB
Markdown
272 lines
10 KiB
Markdown
# Coding Capabilities Test Results
|
|
|
|
## Highscores
|
|
|
|
### Performance Rankings (Duration)
|
|
|
|
| Test | Model | Duration (ms) | Duration (s) |
|
|
|------|-------|--------------|--------------|
|
|
| factorial_function | openai/gpt-3.5-turbo | 1633 | 1.63 |
|
|
| factorial_function | openai/gpt-4o-mini | 2574 | 2.57 |
|
|
| factorial_function | deepseek/deepseek-r1-distill-qwen-14b:free | 4798 | 4.80 |
|
|
| factorial_function | openrouter/quasar-alpha | 5237 | 5.24 |
|
|
| bubble_sort_function | openrouter/quasar-alpha | 1657 | 1.66 |
|
|
| bubble_sort_function | openai/gpt-3.5-turbo | 2181 | 2.18 |
|
|
| bubble_sort_function | openai/gpt-4o-mini | 2692 | 2.69 |
|
|
| bubble_sort_function | deepseek/deepseek-r1-distill-qwen-14b:free | 14881 | 14.88 |
|
|
|
|
## Summary
|
|
|
|
- Total Tests: 8
|
|
- Passed: 0
|
|
- Failed: 8
|
|
- Success Rate: 0.00%
|
|
- Average Duration: 4457ms (4.46s)
|
|
|
|
## 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: 1633ms (1.63s)
|
|
- 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/4/2025, 3:11:31 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;
|
|
return n * factorial(n - 1);
|
|
}`
|
|
- Duration: 4798ms (4.80s)
|
|
- Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) {
|
|
if (n <= 1) return 1;
|
|
return n * factorial(n - 1);
|
|
}
|
|
- Timestamp: 4/4/2025, 3:11:36 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;
|
|
if (n === 0 || n === 1) return 1;
|
|
let result = 1;
|
|
for (let i = 2; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}`
|
|
- Duration: 2574ms (2.57s)
|
|
- 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;
|
|
let result = 1;
|
|
for (let i = 2; i <= n; i++) {
|
|
result *= i;
|
|
}
|
|
return result;
|
|
}
|
|
- Timestamp: 4/4/2025, 3:11:39 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: 5237ms (5.24s)
|
|
- 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/4/2025, 3:11:44 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 i, j;
|
|
for (i = 0; i < arr.length-1; i++) {
|
|
for (j = 0; j < arr.length-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: 2181ms (2.18s)
|
|
- 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 i, j;
|
|
for (i = 0; i < arr.length-1; i++) {
|
|
for (j = 0; j < arr.length-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/4/2025, 3:11:46 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];
|
|
const n = sortedArr.length;
|
|
for (let i = 0; i < n; i++) {
|
|
let swapped = false;
|
|
for (let j = 0; j < n - i - 1; 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: 14881ms (14.88s)
|
|
- 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];
|
|
const n = sortedarr.length;
|
|
for (let i = 0; i < n; i++) {
|
|
let swapped = false;
|
|
for (let j = 0; j < n - i - 1; 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/4/2025, 3:12:01 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: 2692ms (2.69s)
|
|
- 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/4/2025, 3:12:04 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: 1657ms (1.66s)
|
|
- 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/4/2025, 3:12:05 PM
|
|
|
|
## Passed Tests
|
|
|
|
*No passed tests*
|
|
|