#include <stdio.h>
int main(void) {
// your code goes here
// TODO: implement an O(n^2) sorting algorithm
//iterates over array
int values[] = {4,3423,423,23};
int n = 4;
for(int i = 0; i < n - 1; i++){
//sets minimum integer, in this case it is i since no other integers have been checked
int min = i;
// set the integer after i
int j;
// iterates until the array is done
for(j = i + 1; j < n - 1; j++){
// compares current to next array
if(values[i] > values[j]){
// if current is larger than next, make next the lowest
min = j + 1;
}
}
// if min doesnt equal i, switch the variable
if(min != i){
int temp = values[i];
values[i] = values[j];
values[j] = temp;
}
}
for(int i = 0; i < n; i++){
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgkvLyBUT0RPOiBpbXBsZW1lbnQgYW4gTyhuXjIpIHNvcnRpbmcgYWxnb3JpdGhtCiAgICAvL2l0ZXJhdGVzIG92ZXIgYXJyYXkKICAgIGludCB2YWx1ZXNbXSA9IHs0LDM0MjMsNDIzLDIzfTsKICAgIGludCBuID0gNDsKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuIC0gMTsgaSsrKXsKICAgICAgICAvL3NldHMgbWluaW11bSBpbnRlZ2VyLCBpbiB0aGlzIGNhc2UgaXQgaXMgaSBzaW5jZSBubyBvdGhlciBpbnRlZ2VycyBoYXZlIGJlZW4gY2hlY2tlZAogICAgICAgIGludCBtaW4gPSBpOwogICAgICAgIC8vIHNldCB0aGUgaW50ZWdlciBhZnRlciBpCiAgICAgICAgaW50IGo7CiAgICAgICAgLy8gaXRlcmF0ZXMgdW50aWwgdGhlIGFycmF5IGlzIGRvbmUKICAgICAgICBmb3IoaiA9IGkgKyAxOyBqIDwgbiAtIDE7IGorKyl7CiAgICAgICAgICAgIC8vIGNvbXBhcmVzIGN1cnJlbnQgdG8gbmV4dCBhcnJheQogICAgICAgICAgICBpZih2YWx1ZXNbaV0gPiB2YWx1ZXNbal0pewogICAgICAgICAgICAgICAgLy8gaWYgY3VycmVudCBpcyBsYXJnZXIgdGhhbiBuZXh0LCBtYWtlIG5leHQgdGhlIGxvd2VzdAogICAgICAgICAgICAgICAgbWluID0gaiArIDE7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgLy8gaWYgbWluIGRvZXNudCBlcXVhbCBpLCBzd2l0Y2ggdGhlIHZhcmlhYmxlCiAgICAgICAgaWYobWluICE9IGkpewogICAgICAgIGludCB0ZW1wID0gdmFsdWVzW2ldOwogICAgICAgICAgICB2YWx1ZXNbaV0gPSB2YWx1ZXNbal07CiAgICAgICAgICAgIHZhbHVlc1tqXSA9IHRlbXA7CiAgICAgICAgfQogICAgfQogICAgZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CiAgICAJcHJpbnRmKCIlaSBcbiIsIHZhbHVlc1tpXSk7CiAgICB9CglyZXR1cm4gMDsKfQo=