SelectSort

Question

import java.util.Scanner;

public class SelectSort {
public static void main(String[] args) {
int[] intArray = new int[6];
Scanner scan = new Scanner(System.in);
int[] n = scan.nextInt();

int i = 0;
while (i < N) {

//using an object of the Scanner class fill the intArray array
}

i = 0;
while (i < N) {
int j = 0;
while (j < N) {
//implementation of the algorithm: finding the minimum element
j++;
}
//algorithm implementation: put the found minimum element at the beginning of the subarray
i++;
}
i = 0;
while (i < N) {
System.out.print(intArray[i]);
i++;
}
}
}

Answer 1

thanks for such criticism. but this is not a full-fledged code, it is a code skeleton that needs to be added to make it work correctly!

Answer 2

Thank you sir. I accept your criticism and understand that it does not carry any malicious intent. you will forgive me if you were rude. Perhaps I didn’t put it that way. I was pleased to read your messages! What I threw off was just a skeleton of the code.

Answer 3

https://code.sololearn.com/c6ozMMsb4Q85/?ref=app

Answer 4

Here is my solution

Answer 5

removed comments

Answer 6

no, the code doesn't work. you need to create a sorted array, and then sort it in ascending order.

Answer 7

selection sort

Answer 8

I dont no itt

Answer 9

How to upload your code?