id int64 1 2.26k | language stringclasses 7
values | category stringclasses 3
values | difficulty stringclasses 2
values | task_description stringclasses 132
values | code stringlengths 68 753 | explanation stringclasses 449
values |
|---|---|---|---|---|---|---|
301 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(data) {
const n = data.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
[data[i], data[minIdx]] = [data[minIdx], data[i]];
}
return data;
}
console.log(selectionSort([-23, 77, 0, 1, 17,... | Selection sort on int data, variable named 'data', 15 elements. |
302 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(seq) {
const n = seq.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
[seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];
}
return seq;
}
console.log(selectionSort([73, 34, 10, -50, -47, -28, ... | Selection sort on int data, variable named 'seq', 15 elements. |
303 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
console.log(selectionSort([... | Selection sort on int data, variable named 'buffer', 15 elements. |
304 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(records) {
const n = records.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (records[j] < records[minIdx]) minIdx = j;
}
[records[i], records[minIdx]] = [records[minIdx], records[i]];
}
return records;
}
console.log(select... | Selection sort on int data, variable named 'records', 20 elements. |
305 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
console.log(selectionSort([... | Selection sort on int data, variable named 'buffer', 20 elements. |
306 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(arr) {
const n = arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
[arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
}
return arr;
}
console.log(selectionSort([-34, 16, 30, -47, 84, 97, 9... | Selection sort on int data, variable named 'arr', 20 elements. |
307 | JavaScript | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(arr) {
const n = arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
[arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
}
return arr;
}
console.log(selectionSort([56.56, -1.33, 81.01, 81.37,... | Selection sort on float data, variable named 'arr', 5 elements. |
308 | JavaScript | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(data) {
const n = data.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
[data[i], data[minIdx]] = [data[minIdx], data[i]];
}
return data;
}
console.log(selectionSort([69.42, 18.16, 19.3... | Selection sort on float data, variable named 'data', 5 elements. |
309 | JavaScript | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(input_arr) {
const n = input_arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
[input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];
}
return input_arr;
}
... | Selection sort on float data, variable named 'input_arr', 5 elements. |
310 | JavaScript | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(dataset) {
const n = dataset.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (dataset[j] < dataset[minIdx]) minIdx = j;
}
[dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];
}
return dataset;
}
console.log(select... | Selection sort on float data, variable named 'dataset', 8 elements. |
311 | JavaScript | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(input_arr) {
const n = input_arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
[input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];
}
return input_arr;
}
... | Selection sort on float data, variable named 'input_arr', 8 elements. |
312 | JavaScript | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(list1) {
const n = list1.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (list1[j] < list1[minIdx]) minIdx = j;
}
[list1[i], list1[minIdx]] = [list1[minIdx], list1[i]];
}
return list1;
}
console.log(selectionSort([23.24, -1... | Selection sort on float data, variable named 'list1', 8 elements. |
313 | JavaScript | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(seq) {
const n = seq.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
[seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];
}
return seq;
}
console.log(selectionSort([33.85, -8.4, 58.41, -19.74,... | Selection sort on float data, variable named 'seq', 10 elements. |
314 | JavaScript | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
console.log(select... | Selection sort on float data, variable named 'entries', 10 elements. |
315 | JavaScript | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
console.log(selectionSort([2.68, 20.21, 70.1,... | Selection sort on float data, variable named 'vals', 10 elements. |
316 | JavaScript | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(input_arr) {
const n = input_arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
[input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];
}
return input_arr;
}
... | Selection sort on float data, variable named 'input_arr', 12 elements. |
317 | JavaScript | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(values) {
const n = values.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
[values[i], values[minIdx]] = [values[minIdx], values[i]];
}
return values;
}
console.log(selectionSort([... | Selection sort on float data, variable named 'values', 12 elements. |
318 | JavaScript | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
console.log(selectionSort([-4.13, 29.12, 63.3... | Selection sort on float data, variable named 'vals', 12 elements. |
319 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(nums) {
const n = nums.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
[nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];
}
return nums;
}
console.log(selectionSort([61.71, 89.62, -4.2... | Selection sort on float data, variable named 'nums', 15 elements. |
320 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
console.log(select... | Selection sort on float data, variable named 'entries', 15 elements. |
321 | JavaScript | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(nums) {
const n = nums.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
[nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];
}
return nums;
}
console.log(selectionSort([4.28, 44.4, 22.68,... | Selection sort on float data, variable named 'nums', 15 elements. |
322 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(collection) {
const n = collection.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
[collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];
}
return collec... | Selection sort on float data, variable named 'collection', 20 elements. |
323 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(values) {
const n = values.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
[values[i], values[minIdx]] = [values[minIdx], values[i]];
}
return values;
}
console.log(selectionSort([... | Selection sort on float data, variable named 'values', 20 elements. |
324 | JavaScript | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
console.log(selectionSort([48.15, 22.61, 73.3... | Selection sort on float data, variable named 'vals', 20 elements. |
325 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
module.exports = { selectio... | Selection sort on int data, variable named 'buffer', 5 elements. |
326 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
module.exports = {... | Selection sort on int data, variable named 'entries', 5 elements. |
327 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | function selectionSort(collection) {
const n = collection.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
[collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];
}
return collec... | Selection sort on int data, variable named 'collection', 5 elements. |
328 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | function selectionSort(records) {
const n = records.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (records[j] < records[minIdx]) minIdx = j;
}
[records[i], records[minIdx]] = [records[minIdx], records[i]];
}
return records;
}
module.exports = {... | Selection sort on int data, variable named 'records', 8 elements. |
329 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | function selectionSort(list1) {
const n = list1.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (list1[j] < list1[minIdx]) minIdx = j;
}
[list1[i], list1[minIdx]] = [list1[minIdx], list1[i]];
}
return list1;
}
module.exports = { selectionSort };
... | Selection sort on int data, variable named 'list1', 8 elements. |
330 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | function selectionSort(items) {
const n = items.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
[items[i], items[minIdx]] = [items[minIdx], items[i]];
}
return items;
}
module.exports = { selectionSort };
... | Selection sort on int data, variable named 'items', 8 elements. |
331 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | function selectionSort(arr) {
const n = arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
[arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
}
return arr;
}
module.exports = { selectionSort };
console.log(select... | Selection sort on int data, variable named 'arr', 10 elements. |
332 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | function selectionSort(elements) {
const n = elements.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
[elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];
}
return elements;
}
module.ex... | Selection sort on int data, variable named 'elements', 10 elements. |
333 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
module.exports = { selectio... | Selection sort on int data, variable named 'buffer', 10 elements. |
334 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | function selectionSort(nums) {
const n = nums.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
[nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];
}
return nums;
}
module.exports = { selectionSort };
console.l... | Selection sort on int data, variable named 'nums', 12 elements. |
335 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | function selectionSort(seq) {
const n = seq.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
[seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];
}
return seq;
}
module.exports = { selectionSort };
console.log(select... | Selection sort on int data, variable named 'seq', 12 elements. |
336 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | function selectionSort(arr) {
const n = arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
[arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
}
return arr;
}
module.exports = { selectionSort };
console.log(select... | Selection sort on int data, variable named 'arr', 12 elements. |
337 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(values) {
const n = values.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
[values[i], values[minIdx]] = [values[minIdx], values[i]];
}
return values;
}
module.exports = { selectio... | Selection sort on int data, variable named 'values', 15 elements. |
338 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(data) {
const n = data.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
[data[i], data[minIdx]] = [data[minIdx], data[i]];
}
return data;
}
module.exports = { selectionSort };
console.l... | Selection sort on int data, variable named 'data', 15 elements. |
339 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | function selectionSort(elements) {
const n = elements.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
[elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];
}
return elements;
}
module.ex... | Selection sort on int data, variable named 'elements', 15 elements. |
340 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(records) {
const n = records.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (records[j] < records[minIdx]) minIdx = j;
}
[records[i], records[minIdx]] = [records[minIdx], records[i]];
}
return records;
}
module.exports = {... | Selection sort on int data, variable named 'records', 20 elements. |
341 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
module.exports = {... | Selection sort on int data, variable named 'entries', 20 elements. |
342 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | function selectionSort(input_arr) {
const n = input_arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
[input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];
}
return input_arr;
}
... | Selection sort on int data, variable named 'input_arr', 20 elements. |
343 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
module.exports = { selectionSort };
console.l... | Selection sort on float data, variable named 'vals', 5 elements. |
344 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
module.exports = {... | Selection sort on float data, variable named 'entries', 5 elements. |
345 | Node.js | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
module.exports = { selectio... | Selection sort on float data, variable named 'buffer', 5 elements. |
346 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(nums) {
const n = nums.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
[nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];
}
return nums;
}
module.exports = { selectionSort };
console.l... | Selection sort on float data, variable named 'nums', 8 elements. |
347 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(entries) {
const n = entries.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
[entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];
}
return entries;
}
module.exports = {... | Selection sort on float data, variable named 'entries', 8 elements. |
348 | Node.js | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | function selectionSort(dataset) {
const n = dataset.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (dataset[j] < dataset[minIdx]) minIdx = j;
}
[dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];
}
return dataset;
}
module.exports = {... | Selection sort on float data, variable named 'dataset', 8 elements. |
349 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(items) {
const n = items.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
[items[i], items[minIdx]] = [items[minIdx], items[i]];
}
return items;
}
module.exports = { selectionSort };
... | Selection sort on float data, variable named 'items', 10 elements. |
350 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(elements) {
const n = elements.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
[elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];
}
return elements;
}
module.ex... | Selection sort on float data, variable named 'elements', 10 elements. |
351 | Node.js | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | function selectionSort(arr) {
const n = arr.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
[arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
}
return arr;
}
module.exports = { selectionSort };
console.log(select... | Selection sort on float data, variable named 'arr', 10 elements. |
352 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(values) {
const n = values.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
[values[i], values[minIdx]] = [values[minIdx], values[i]];
}
return values;
}
module.exports = { selectio... | Selection sort on float data, variable named 'values', 12 elements. |
353 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(items) {
const n = items.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
[items[i], items[minIdx]] = [items[minIdx], items[i]];
}
return items;
}
module.exports = { selectionSort };
... | Selection sort on float data, variable named 'items', 12 elements. |
354 | Node.js | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
module.exports = { selectio... | Selection sort on float data, variable named 'buffer', 12 elements. |
355 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
module.exports = { selectionSort };
console.l... | Selection sort on float data, variable named 'vals', 15 elements. |
356 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(seq) {
const n = seq.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
[seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];
}
return seq;
}
module.exports = { selectionSort };
console.log(select... | Selection sort on float data, variable named 'seq', 15 elements. |
357 | Node.js | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | function selectionSort(buffer) {
const n = buffer.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
[buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];
}
return buffer;
}
module.exports = { selectio... | Selection sort on float data, variable named 'buffer', 15 elements. |
358 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(vals) {
const n = vals.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
[vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];
}
return vals;
}
module.exports = { selectionSort };
console.l... | Selection sort on float data, variable named 'vals', 20 elements. |
359 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(collection) {
const n = collection.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
[collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];
}
return collec... | Selection sort on float data, variable named 'collection', 20 elements. |
360 | Node.js | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | function selectionSort(values) {
const n = values.length;
for (let i = 0; i < n; i++) {
let minIdx = i;
for (let j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
[values[i], values[minIdx]] = [values[minIdx], values[i]];
}
return values;
}
module.exports = { selectio... | Selection sort on float data, variable named 'values', 20 elements. |
361 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] values) {
int n = values.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
int temp = values[i];
... | Selection sort on int data, variable named 'values', 5 elements. |
362 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] input_arr) {
int n = input_arr.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
int temp = in... | Selection sort on int data, variable named 'input_arr', 5 elements. |
363 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] entries) {
int n = entries.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
int temp = entries[i]... | Selection sort on int data, variable named 'entries', 5 elements. |
364 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] elements) {
int n = elements.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
int temp = elemen... | Selection sort on int data, variable named 'elements', 8 elements. |
365 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] nums) {
int n = nums.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
int temp = nums[i];
n... | Selection sort on int data, variable named 'nums', 8 elements. |
366 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] input_arr) {
int n = input_arr.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
int temp = in... | Selection sort on int data, variable named 'input_arr', 8 elements. |
367 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] input_arr) {
int n = input_arr.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[minIdx]) minIdx = j;
}
int temp = in... | Selection sort on int data, variable named 'input_arr', 10 elements. |
368 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] seq) {
int n = seq.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
int temp = seq[i];
seq[i]... | Selection sort on int data, variable named 'seq', 10 elements. |
369 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] vals) {
int n = vals.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
int temp = vals[i];
v... | Selection sort on int data, variable named 'vals', 10 elements. |
370 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] dataset) {
int n = dataset.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[minIdx]) minIdx = j;
}
int temp = dataset[i]... | Selection sort on int data, variable named 'dataset', 12 elements. |
371 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] vals) {
int n = vals.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
int temp = vals[i];
v... | Selection sort on int data, variable named 'vals', 12 elements. |
372 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] list1) {
int n = list1.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (list1[j] < list1[minIdx]) minIdx = j;
}
int temp = list1[i];
... | Selection sort on int data, variable named 'list1', 12 elements. |
373 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] items) {
int n = items.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
int temp = items[i];
... | Selection sort on int data, variable named 'items', 15 elements. |
374 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] elements) {
int n = elements.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
int temp = elemen... | Selection sort on int data, variable named 'elements', 15 elements. |
375 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] collection) {
int n = collection.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
int temp ... | Selection sort on int data, variable named 'collection', 15 elements. |
376 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] items) {
int n = items.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
int temp = items[i];
... | Selection sort on int data, variable named 'items', 20 elements. |
377 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] values) {
int n = values.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
int temp = values[i];
... | Selection sort on int data, variable named 'values', 20 elements. |
378 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | public class Main {
static void selectionSort(int[] items) {
int n = items.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
int temp = items[i];
... | Selection sort on int data, variable named 'items', 20 elements. |
379 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] collection) {
int n = collection.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
double... | Selection sort on float data, variable named 'collection', 5 elements. |
380 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] collection) {
int n = collection.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
double... | Selection sort on float data, variable named 'collection', 5 elements. |
381 | Java | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] entries) {
int n = entries.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
double temp = entr... | Selection sort on float data, variable named 'entries', 5 elements. |
382 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] values) {
int n = values.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
double temp = values[i... | Selection sort on float data, variable named 'values', 8 elements. |
383 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] entries) {
int n = entries.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (entries[j] < entries[minIdx]) minIdx = j;
}
double temp = entr... | Selection sort on float data, variable named 'entries', 8 elements. |
384 | Java | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] elements) {
int n = elements.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[minIdx]) minIdx = j;
}
double temp = ... | Selection sort on float data, variable named 'elements', 8 elements. |
385 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] collection) {
int n = collection.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (collection[j] < collection[minIdx]) minIdx = j;
}
double... | Selection sort on float data, variable named 'collection', 10 elements. |
386 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] dataset) {
int n = dataset.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[minIdx]) minIdx = j;
}
double temp = data... | Selection sort on float data, variable named 'dataset', 10 elements. |
387 | Java | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] seq) {
int n = seq.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (seq[j] < seq[minIdx]) minIdx = j;
}
double temp = seq[i];
... | Selection sort on float data, variable named 'seq', 10 elements. |
388 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] nums) {
int n = nums.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
double temp = nums[i];
... | Selection sort on float data, variable named 'nums', 12 elements. |
389 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] values) {
int n = values.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[minIdx]) minIdx = j;
}
double temp = values[i... | Selection sort on float data, variable named 'values', 12 elements. |
390 | Java | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] vals) {
int n = vals.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
double temp = vals[i];
... | Selection sort on float data, variable named 'vals', 12 elements. |
391 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] nums) {
int n = nums.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
double temp = nums[i];
... | Selection sort on float data, variable named 'nums', 15 elements. |
392 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] nums) {
int n = nums.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[minIdx]) minIdx = j;
}
double temp = nums[i];
... | Selection sort on float data, variable named 'nums', 15 elements. |
393 | Java | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] vals) {
int n = vals.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[minIdx]) minIdx = j;
}
double temp = vals[i];
... | Selection sort on float data, variable named 'vals', 15 elements. |
394 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] buffer) {
int n = buffer.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (buffer[j] < buffer[minIdx]) minIdx = j;
}
double temp = buffer[i... | Selection sort on float data, variable named 'buffer', 20 elements. |
395 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] dataset) {
int n = dataset.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[minIdx]) minIdx = j;
}
double temp = data... | Selection sort on float data, variable named 'dataset', 20 elements. |
396 | Java | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | public class Main {
static void selectionSort(double[] items) {
int n = items.length;
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (items[j] < items[minIdx]) minIdx = j;
}
double temp = items[i];
... | Selection sort on float data, variable named 'items', 20 elements. |
397 | C | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int buffer[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (buffer[j] < buffer[min_idx]) min_idx = j;
}
int temp = buffer[i];
buffer[i] = buffer[min_idx];
buffer[min_id... | Selection sort on int data, variable named 'buffer', 5 elements. |
398 | C | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int list1[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (list1[j] < list1[min_idx]) min_idx = j;
}
int temp = list1[i];
list1[i] = list1[min_idx];
list1[min_idx] = te... | Selection sort on int data, variable named 'list1', 5 elements. |
399 | C | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int entries[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (entries[j] < entries[min_idx]) min_idx = j;
}
int temp = entries[i];
entries[i] = entries[min_idx];
entries... | Selection sort on int data, variable named 'entries', 5 elements. |
400 | C | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int seq[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (seq[j] < seq[min_idx]) min_idx = j;
}
int temp = seq[i];
seq[i] = seq[min_idx];
seq[min_idx] = temp;
}
}
i... | Selection sort on int data, variable named 'seq', 8 elements. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.