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 |
|---|---|---|---|---|---|---|
401 | C | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int data[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[min_idx]) min_idx = j;
}
int temp = data[i];
data[i] = data[min_idx];
data[min_idx] = temp;
... | Selection sort on int data, variable named 'data', 8 elements. |
402 | C | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int items[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (items[j] < items[min_idx]) min_idx = j;
}
int temp = items[i];
items[i] = items[min_idx];
items[min_idx] = te... | Selection sort on int data, variable named 'items', 8 elements. |
403 | C | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int vals[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[min_idx]) min_idx = j;
}
int temp = vals[i];
vals[i] = vals[min_idx];
vals[min_idx] = temp;
... | Selection sort on int data, variable named 'vals', 10 elements. |
404 | C | Sorting Algorithm | intermediate | Sort a 10-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', 10 elements. |
405 | C | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int records[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (records[j] < records[min_idx]) min_idx = j;
}
int temp = records[i];
records[i] = records[min_idx];
records... | Selection sort on int data, variable named 'records', 10 elements. |
406 | C | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int dataset[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[min_idx]) min_idx = j;
}
int temp = dataset[i];
dataset[i] = dataset[min_idx];
dataset... | Selection sort on int data, variable named 'dataset', 12 elements. |
407 | C | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int records[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (records[j] < records[min_idx]) min_idx = j;
}
int temp = records[i];
records[i] = records[min_idx];
records... | Selection sort on int data, variable named 'records', 12 elements. |
408 | C | Sorting Algorithm | intermediate | Sort a 12-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', 12 elements. |
409 | C | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int elements[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[min_idx]) min_idx = j;
}
int temp = elements[i];
elements[i] = elements[min_idx];
e... | Selection sort on int data, variable named 'elements', 15 elements. |
410 | C | Sorting Algorithm | intermediate | Sort a 15-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', 15 elements. |
411 | C | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int input_arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[min_idx]) min_idx = j;
}
int temp = input_arr[i];
input_arr[i] = input_arr[min_idx];
... | Selection sort on int data, variable named 'input_arr', 15 elements. |
412 | C | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int data[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[min_idx]) min_idx = j;
}
int temp = data[i];
data[i] = data[min_idx];
data[min_idx] = temp;
... | Selection sort on int data, variable named 'data', 20 elements. |
413 | C | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | #include <stdio.h>
void selection_sort(int elements[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[min_idx]) min_idx = j;
}
int temp = elements[i];
elements[i] = elements[min_idx];
e... | Selection sort on int data, variable named 'elements', 20 elements. |
414 | C | Sorting Algorithm | intermediate | Sort a 20-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', 20 elements. |
415 | C | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[min_idx]) min_idx = j;
}
double temp = arr[i];
arr[i] = arr[min_idx];
arr[min_idx] = temp;
... | Selection sort on float data, variable named 'arr', 5 elements. |
416 | C | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double input_arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[min_idx]) min_idx = j;
}
double temp = input_arr[i];
input_arr[i] = input_arr[min_idx... | Selection sort on float data, variable named 'input_arr', 5 elements. |
417 | C | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double elements[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[min_idx]) min_idx = j;
}
double temp = elements[i];
elements[i] = elements[min_idx];
... | Selection sort on float data, variable named 'elements', 5 elements. |
418 | C | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double 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;
}
double temp = seq[i];
seq[i] = seq[min_idx];
seq[min_idx] = temp;
... | Selection sort on float data, variable named 'seq', 8 elements. |
419 | C | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double records[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (records[j] < records[min_idx]) min_idx = j;
}
double temp = records[i];
records[i] = records[min_idx];
r... | Selection sort on float data, variable named 'records', 8 elements. |
420 | C | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double dataset[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[min_idx]) min_idx = j;
}
double temp = dataset[i];
dataset[i] = dataset[min_idx];
d... | Selection sort on float data, variable named 'dataset', 8 elements. |
421 | C | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double input_arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[min_idx]) min_idx = j;
}
double temp = input_arr[i];
input_arr[i] = input_arr[min_idx... | Selection sort on float data, variable named 'input_arr', 10 elements. |
422 | C | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[min_idx]) min_idx = j;
}
double temp = arr[i];
arr[i] = arr[min_idx];
arr[min_idx] = temp;
... | Selection sort on float data, variable named 'arr', 10 elements. |
423 | C | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double data[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[min_idx]) min_idx = j;
}
double temp = data[i];
data[i] = data[min_idx];
data[min_idx] = tem... | Selection sort on float data, variable named 'data', 10 elements. |
424 | C | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double dataset[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (dataset[j] < dataset[min_idx]) min_idx = j;
}
double temp = dataset[i];
dataset[i] = dataset[min_idx];
d... | Selection sort on float data, variable named 'dataset', 12 elements. |
425 | C | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double values[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[min_idx]) min_idx = j;
}
double temp = values[i];
values[i] = values[min_idx];
values[... | Selection sort on float data, variable named 'values', 12 elements. |
426 | C | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double collection[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (collection[j] < collection[min_idx]) min_idx = j;
}
double temp = collection[i];
collection[i] = collection[m... | Selection sort on float data, variable named 'collection', 12 elements. |
427 | C | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double elements[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (elements[j] < elements[min_idx]) min_idx = j;
}
double temp = elements[i];
elements[i] = elements[min_idx];
... | Selection sort on float data, variable named 'elements', 15 elements. |
428 | C | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double vals[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[min_idx]) min_idx = j;
}
double temp = vals[i];
vals[i] = vals[min_idx];
vals[min_idx] = tem... | Selection sort on float data, variable named 'vals', 15 elements. |
429 | C | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double vals[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (vals[j] < vals[min_idx]) min_idx = j;
}
double temp = vals[i];
vals[i] = vals[min_idx];
vals[min_idx] = tem... | Selection sort on float data, variable named 'vals', 15 elements. |
430 | C | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double input_arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[min_idx]) min_idx = j;
}
double temp = input_arr[i];
input_arr[i] = input_arr[min_idx... | Selection sort on float data, variable named 'input_arr', 20 elements. |
431 | C | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double values[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (values[j] < values[min_idx]) min_idx = j;
}
double temp = values[i];
values[i] = values[min_idx];
values[... | Selection sort on float data, variable named 'values', 20 elements. |
432 | C | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <stdio.h>
void selection_sort(double input_arr[], int n) {
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i + 1; j < n; j++) {
if (input_arr[j] < input_arr[min_idx]) min_idx = j;
}
double temp = input_arr[i];
input_arr[i] = input_arr[min_idx... | Selection sort on float data, variable named 'input_arr', 20 elements. |
433 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& entries) {
int n = (int) entries.size();
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;
}
std::swap(entries[i], e... | Selection sort on int data, variable named 'entries', 5 elements. |
434 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& dataset) {
int n = (int) dataset.size();
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;
}
std::swap(dataset[i], d... | Selection sort on int data, variable named 'dataset', 5 elements. |
435 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& items) {
int n = (int) items.size();
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;
}
std::swap(items[i], items[minId... | Selection sort on int data, variable named 'items', 5 elements. |
436 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& data) {
int n = (int) data.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
std::swap(data[i], data[minIdx]);
... | Selection sort on int data, variable named 'data', 8 elements. |
437 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& values) {
int n = (int) values.size();
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;
}
std::swap(values[i], values... | Selection sort on int data, variable named 'values', 8 elements. |
438 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& entries) {
int n = (int) entries.size();
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;
}
std::swap(entries[i], e... | Selection sort on int data, variable named 'entries', 8 elements. |
439 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& vals) {
int n = (int) vals.size();
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;
}
std::swap(vals[i], vals[minIdx]);
... | Selection sort on int data, variable named 'vals', 10 elements. |
440 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& entries) {
int n = (int) entries.size();
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;
}
std::swap(entries[i], e... | Selection sort on int data, variable named 'entries', 10 elements. |
441 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& list1) {
int n = (int) list1.size();
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;
}
std::swap(list1[i], list1[minId... | Selection sort on int data, variable named 'list1', 10 elements. |
442 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& dataset) {
int n = (int) dataset.size();
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;
}
std::swap(dataset[i], d... | Selection sort on int data, variable named 'dataset', 12 elements. |
443 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& dataset) {
int n = (int) dataset.size();
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;
}
std::swap(dataset[i], d... | Selection sort on int data, variable named 'dataset', 12 elements. |
444 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& arr) {
int n = (int) arr.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
std::swap(arr[i], arr[minIdx]);
}
}... | Selection sort on int data, variable named 'arr', 12 elements. |
445 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& input_arr) {
int n = (int) input_arr.size();
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;
}
std::swap(input... | Selection sort on int data, variable named 'input_arr', 15 elements. |
446 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& buffer) {
int n = (int) buffer.size();
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;
}
std::swap(buffer[i], buffer... | Selection sort on int data, variable named 'buffer', 15 elements. |
447 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& arr) {
int n = (int) arr.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
std::swap(arr[i], arr[minIdx]);
}
}... | Selection sort on int data, variable named 'arr', 15 elements. |
448 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& elements) {
int n = (int) elements.size();
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;
}
std::swap(elements[... | Selection sort on int data, variable named 'elements', 20 elements. |
449 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& entries) {
int n = (int) entries.size();
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;
}
std::swap(entries[i], e... | Selection sort on int data, variable named 'entries', 20 elements. |
450 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<int>& collection) {
int n = (int) collection.size();
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;
}
std::swap(c... | Selection sort on int data, variable named 'collection', 20 elements. |
451 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& nums) {
int n = (int) nums.size();
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;
}
std::swap(nums[i], nums[minIdx])... | Selection sort on float data, variable named 'nums', 5 elements. |
452 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& data) {
int n = (int) data.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
std::swap(data[i], data[minIdx])... | Selection sort on float data, variable named 'data', 5 elements. |
453 | C++ | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& list1) {
int n = (int) list1.size();
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;
}
std::swap(list1[i], list1[mi... | Selection sort on float data, variable named 'list1', 5 elements. |
454 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& nums) {
int n = (int) nums.size();
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;
}
std::swap(nums[i], nums[minIdx])... | Selection sort on float data, variable named 'nums', 8 elements. |
455 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& collection) {
int n = (int) collection.size();
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;
}
std::swa... | Selection sort on float data, variable named 'collection', 8 elements. |
456 | C++ | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& items) {
int n = (int) items.size();
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;
}
std::swap(items[i], items[mi... | Selection sort on float data, variable named 'items', 8 elements. |
457 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& entries) {
int n = (int) entries.size();
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;
}
std::swap(entries[i]... | Selection sort on float data, variable named 'entries', 10 elements. |
458 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& list1) {
int n = (int) list1.size();
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;
}
std::swap(list1[i], list1[mi... | Selection sort on float data, variable named 'list1', 10 elements. |
459 | C++ | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& values) {
int n = (int) values.size();
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;
}
std::swap(values[i], val... | Selection sort on float data, variable named 'values', 10 elements. |
460 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& dataset) {
int n = (int) dataset.size();
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;
}
std::swap(dataset[i]... | Selection sort on float data, variable named 'dataset', 12 elements. |
461 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& input_arr) {
int n = (int) input_arr.size();
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;
}
std::swap(in... | Selection sort on float data, variable named 'input_arr', 12 elements. |
462 | C++ | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& collection) {
int n = (int) collection.size();
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;
}
std::swa... | Selection sort on float data, variable named 'collection', 12 elements. |
463 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& arr) {
int n = (int) arr.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIdx]) minIdx = j;
}
std::swap(arr[i], arr[minIdx]);
... | Selection sort on float data, variable named 'arr', 15 elements. |
464 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& data) {
int n = (int) data.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
std::swap(data[i], data[minIdx])... | Selection sort on float data, variable named 'data', 15 elements. |
465 | C++ | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& elements) {
int n = (int) elements.size();
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;
}
std::swap(elemen... | Selection sort on float data, variable named 'elements', 15 elements. |
466 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& data) {
int n = (int) data.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
std::swap(data[i], data[minIdx])... | Selection sort on float data, variable named 'data', 20 elements. |
467 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& dataset) {
int n = (int) dataset.size();
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;
}
std::swap(dataset[i]... | Selection sort on float data, variable named 'dataset', 20 elements. |
468 | C++ | Sorting Algorithm | intermediate | Sort a 20-element array of floats in ascending order using selection sort. | #include <iostream>
#include <vector>
void selectionSort(std::vector<double>& data) {
int n = (int) data.size();
for (int i = 0; i < n; i++) {
int minIdx = i;
for (int j = i + 1; j < n; j++) {
if (data[j] < data[minIdx]) minIdx = j;
}
std::swap(data[i], data[minIdx])... | Selection sort on float data, variable named 'data', 20 elements. |
469 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | fn selection_sort(elements: &mut Vec<i32>) {
let n = elements.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if elements[j] < elements[min_idx] {
min_idx = j;
}
}
elements.swap(i, min_idx);
}
}
fn main() {
let mu... | Selection sort on int data, variable named 'elements', 5 elements. |
470 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | fn selection_sort(elements: &mut Vec<i32>) {
let n = elements.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if elements[j] < elements[min_idx] {
min_idx = j;
}
}
elements.swap(i, min_idx);
}
}
fn main() {
let mu... | Selection sort on int data, variable named 'elements', 5 elements. |
471 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of ints in ascending order using selection sort. | fn selection_sort(nums: &mut Vec<i32>) {
let n = nums.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if nums[j] < nums[min_idx] {
min_idx = j;
}
}
nums.swap(i, min_idx);
}
}
fn main() {
let mut nums = vec![74, -2... | Selection sort on int data, variable named 'nums', 5 elements. |
472 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | fn selection_sort(records: &mut Vec<i32>) {
let n = records.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if records[j] < records[min_idx] {
min_idx = j;
}
}
records.swap(i, min_idx);
}
}
fn main() {
let mut rec... | Selection sort on int data, variable named 'records', 8 elements. |
473 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | fn selection_sort(elements: &mut Vec<i32>) {
let n = elements.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if elements[j] < elements[min_idx] {
min_idx = j;
}
}
elements.swap(i, min_idx);
}
}
fn main() {
let mu... | Selection sort on int data, variable named 'elements', 8 elements. |
474 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of ints in ascending order using selection sort. | fn selection_sort(values: &mut Vec<i32>) {
let n = values.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if values[j] < values[min_idx] {
min_idx = j;
}
}
values.swap(i, min_idx);
}
}
fn main() {
let mut values =... | Selection sort on int data, variable named 'values', 8 elements. |
475 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | fn selection_sort(vals: &mut Vec<i32>) {
let n = vals.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if vals[j] < vals[min_idx] {
min_idx = j;
}
}
vals.swap(i, min_idx);
}
}
fn main() {
let mut vals = vec![48, 10... | Selection sort on int data, variable named 'vals', 10 elements. |
476 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | fn selection_sort(arr: &mut Vec<i32>) {
let n = arr.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if arr[j] < arr[min_idx] {
min_idx = j;
}
}
arr.swap(i, min_idx);
}
}
fn main() {
let mut arr = vec![-8, 68, 52, ... | Selection sort on int data, variable named 'arr', 10 elements. |
477 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of ints in ascending order using selection sort. | fn selection_sort(dataset: &mut Vec<i32>) {
let n = dataset.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if dataset[j] < dataset[min_idx] {
min_idx = j;
}
}
dataset.swap(i, min_idx);
}
}
fn main() {
let mut dat... | Selection sort on int data, variable named 'dataset', 10 elements. |
478 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | fn selection_sort(buffer: &mut Vec<i32>) {
let n = buffer.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if buffer[j] < buffer[min_idx] {
min_idx = j;
}
}
buffer.swap(i, min_idx);
}
}
fn main() {
let mut buffer =... | Selection sort on int data, variable named 'buffer', 12 elements. |
479 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | fn selection_sort(collection: &mut Vec<i32>) {
let n = collection.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if collection[j] < collection[min_idx] {
min_idx = j;
}
}
collection.swap(i, min_idx);
}
}
fn main() {
... | Selection sort on int data, variable named 'collection', 12 elements. |
480 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of ints in ascending order using selection sort. | fn selection_sort(collection: &mut Vec<i32>) {
let n = collection.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if collection[j] < collection[min_idx] {
min_idx = j;
}
}
collection.swap(i, min_idx);
}
}
fn main() {
... | Selection sort on int data, variable named 'collection', 12 elements. |
481 | Rust | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | fn selection_sort(arr: &mut Vec<i32>) {
let n = arr.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if arr[j] < arr[min_idx] {
min_idx = j;
}
}
arr.swap(i, min_idx);
}
}
fn main() {
let mut arr = vec![5, -19, -20,... | Selection sort on int data, variable named 'arr', 15 elements. |
482 | Rust | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | fn selection_sort(entries: &mut Vec<i32>) {
let n = entries.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if entries[j] < entries[min_idx] {
min_idx = j;
}
}
entries.swap(i, min_idx);
}
}
fn main() {
let mut ent... | Selection sort on int data, variable named 'entries', 15 elements. |
483 | Rust | Sorting Algorithm | intermediate | Sort a 15-element array of ints in ascending order using selection sort. | fn selection_sort(dataset: &mut Vec<i32>) {
let n = dataset.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if dataset[j] < dataset[min_idx] {
min_idx = j;
}
}
dataset.swap(i, min_idx);
}
}
fn main() {
let mut dat... | Selection sort on int data, variable named 'dataset', 15 elements. |
484 | Rust | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | fn selection_sort(arr: &mut Vec<i32>) {
let n = arr.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if arr[j] < arr[min_idx] {
min_idx = j;
}
}
arr.swap(i, min_idx);
}
}
fn main() {
let mut arr = vec![-32, -32, 96... | Selection sort on int data, variable named 'arr', 20 elements. |
485 | Rust | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | fn selection_sort(collection: &mut Vec<i32>) {
let n = collection.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if collection[j] < collection[min_idx] {
min_idx = j;
}
}
collection.swap(i, min_idx);
}
}
fn main() {
... | Selection sort on int data, variable named 'collection', 20 elements. |
486 | Rust | Sorting Algorithm | intermediate | Sort a 20-element array of ints in ascending order using selection sort. | fn selection_sort(records: &mut Vec<i32>) {
let n = records.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if records[j] < records[min_idx] {
min_idx = j;
}
}
records.swap(i, min_idx);
}
}
fn main() {
let mut rec... | Selection sort on int data, variable named 'records', 20 elements. |
487 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | fn selection_sort(seq: &mut Vec<f64>) {
let n = seq.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if seq[j] < seq[min_idx] {
min_idx = j;
}
}
seq.swap(i, min_idx);
}
}
fn main() {
let mut seq = vec![98.57, 8.38,... | Selection sort on float data, variable named 'seq', 5 elements. |
488 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | fn selection_sort(dataset: &mut Vec<f64>) {
let n = dataset.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if dataset[j] < dataset[min_idx] {
min_idx = j;
}
}
dataset.swap(i, min_idx);
}
}
fn main() {
let mut dat... | Selection sort on float data, variable named 'dataset', 5 elements. |
489 | Rust | Sorting Algorithm | intermediate | Sort a 5-element array of floats in ascending order using selection sort. | fn selection_sort(arr: &mut Vec<f64>) {
let n = arr.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if arr[j] < arr[min_idx] {
min_idx = j;
}
}
arr.swap(i, min_idx);
}
}
fn main() {
let mut arr = vec![20.19, 65.8,... | Selection sort on float data, variable named 'arr', 5 elements. |
490 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | fn selection_sort(input_arr: &mut Vec<f64>) {
let n = input_arr.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if input_arr[j] < input_arr[min_idx] {
min_idx = j;
}
}
input_arr.swap(i, min_idx);
}
}
fn main() {
l... | Selection sort on float data, variable named 'input_arr', 8 elements. |
491 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | fn selection_sort(buffer: &mut Vec<f64>) {
let n = buffer.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if buffer[j] < buffer[min_idx] {
min_idx = j;
}
}
buffer.swap(i, min_idx);
}
}
fn main() {
let mut buffer =... | Selection sort on float data, variable named 'buffer', 8 elements. |
492 | Rust | Sorting Algorithm | intermediate | Sort a 8-element array of floats in ascending order using selection sort. | fn selection_sort(records: &mut Vec<f64>) {
let n = records.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if records[j] < records[min_idx] {
min_idx = j;
}
}
records.swap(i, min_idx);
}
}
fn main() {
let mut rec... | Selection sort on float data, variable named 'records', 8 elements. |
493 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | fn selection_sort(items: &mut Vec<f64>) {
let n = items.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if items[j] < items[min_idx] {
min_idx = j;
}
}
items.swap(i, min_idx);
}
}
fn main() {
let mut items = vec![... | Selection sort on float data, variable named 'items', 10 elements. |
494 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | fn selection_sort(vals: &mut Vec<f64>) {
let n = vals.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if vals[j] < vals[min_idx] {
min_idx = j;
}
}
vals.swap(i, min_idx);
}
}
fn main() {
let mut vals = vec![5.37, ... | Selection sort on float data, variable named 'vals', 10 elements. |
495 | Rust | Sorting Algorithm | intermediate | Sort a 10-element array of floats in ascending order using selection sort. | fn selection_sort(elements: &mut Vec<f64>) {
let n = elements.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if elements[j] < elements[min_idx] {
min_idx = j;
}
}
elements.swap(i, min_idx);
}
}
fn main() {
let mu... | Selection sort on float data, variable named 'elements', 10 elements. |
496 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | fn selection_sort(buffer: &mut Vec<f64>) {
let n = buffer.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if buffer[j] < buffer[min_idx] {
min_idx = j;
}
}
buffer.swap(i, min_idx);
}
}
fn main() {
let mut buffer =... | Selection sort on float data, variable named 'buffer', 12 elements. |
497 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | fn selection_sort(elements: &mut Vec<f64>) {
let n = elements.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if elements[j] < elements[min_idx] {
min_idx = j;
}
}
elements.swap(i, min_idx);
}
}
fn main() {
let mu... | Selection sort on float data, variable named 'elements', 12 elements. |
498 | Rust | Sorting Algorithm | intermediate | Sort a 12-element array of floats in ascending order using selection sort. | fn selection_sort(vals: &mut Vec<f64>) {
let n = vals.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if vals[j] < vals[min_idx] {
min_idx = j;
}
}
vals.swap(i, min_idx);
}
}
fn main() {
let mut vals = vec![97.43,... | Selection sort on float data, variable named 'vals', 12 elements. |
499 | Rust | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | fn selection_sort(entries: &mut Vec<f64>) {
let n = entries.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if entries[j] < entries[min_idx] {
min_idx = j;
}
}
entries.swap(i, min_idx);
}
}
fn main() {
let mut ent... | Selection sort on float data, variable named 'entries', 15 elements. |
500 | Rust | Sorting Algorithm | intermediate | Sort a 15-element array of floats in ascending order using selection sort. | fn selection_sort(seq: &mut Vec<f64>) {
let n = seq.len();
for i in 0..n {
let mut min_idx = i;
for j in (i + 1)..n {
if seq[j] < seq[min_idx] {
min_idx = j;
}
}
seq.swap(i, min_idx);
}
}
fn main() {
let mut seq = vec![32.93, 48.99... | Selection sort on float data, variable named 'seq', 15 elements. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.