So I have this in a class file. It is supposed to be an insertion sorter:

int min, index=0, temp;
for(int i=0;i<sorted.length;i++){
min=sorted[i];
for(int j=i+1;j<sorted.length;j++){
if(sorted[j]<min){
index=j;
min=sorted[j];
}
}
temp=sorted[index];
sorted[index]=sorted[i];
sorted[i]=temp;
}

and from all I can see everything should be good. Except, it gives the following output:

-100, -8, 1, 6, 11, 17, 23, 24, 33, 35, 42, 43, 76, 79, 84, 88, 99, 124, 240, 242, 268, 357, 9000, 424, 2424

I don't understand why it won't order the last 3. Help anyone?

Related Tutorials/Questions & Answers:

**Insertion Sort Problem**
Insertion Sort Problem So I have this in a class file. It is supposed to be an

insertion sorter:
int min, index=0, temp;
for(int i=0;i<sorted.length;i++){
min=sorted[i];
for(int j=i+1;j<

**insertion sort**
insertion sort how many arrays needed for

insertion sort and why

Advertisements

**insertion sort**
insertion sort write a program in java using

insertion sort
**insertion sort**
insertion sort write a program in java using

insertion sort
**insertion sort**
insertion sort write a program in java using

insertion sort
**insertion sort**
insertion sort write a program in java using

insertion sort
**Insertion Sort Applet**
Insertion Sort Applet I need

Insertion Sort Applet code was design by Dr. Daniel Liang
Please

**Insertion Sort Timer**
Insertion Sort Timer Welcome all
I wanna program in java find the timer of

insertion sort and find time complexity for random value
thanks all

**Java insertion sort question**
Java

insertion sort question I've got another program that I need help with. I am trying to write a Java method that accepts an array of strings, and sorts the strings using the

insertion sort algorithm. Then I need to write

**Insertion Sort - Java Beginners**
Insertion Sort Hello rose india java experts.If you don't mind.Can you help me.What is the code for

Insertion Sort and Selection

Sort that displays...:
public class InsertionSort {
public static void

sort(String[] array) {
int

**Insertion Sort In Java**
Insertion Sort In Java
...
In this example we are going to

sort integer values of an array using

insertion
sort.

Insertion sorting algorithm is similar to bubble

sort. But

insertion sort
**Insertion Sort Java**
Insertion Sort in Java is an algorithm that is used to

sort integer values...,

Insertion Sort in Java is less efficient when it comes to larger data sets... decreasing.
How does

Insertion Sort works in Java?
Assume that you have 5

**complete this code (insertion sort) - Java Beginners**
complete this code (

insertion sort) Your task is to develop part... 2
Sorted list: 1 2 4 7 9
2 Algorithm
To solve this

problem you are going to use a modiŻed version of

insertion-

sort algorithm
which works as follows

**hibernate insertion problem - Hibernate**
hibernate

insertion problem Hi ,
Thanks for the material .Its very gud .
when i run FirstExample.java i get the message

insertion has been done int the table contact . but whne i look into database data is not inserted

**Java insertion sort with string array**
Java

insertion sort with string array
In this tutorial, you will learn how to

sort array of strings using string
array with

Insertion Sort. For this, we... array using inserting

sort algorithm. In the main method, we
have invoked

**Heap Sort in Java**
Heap

Sort in Java is used to

sort integer values of an array. Like quicksort,

insertion sort, bubble

sort and other sorting methods, heap

sort is used to

sort
an unsorted list. When compared to other sorting methods heap

sort
**Merge Sort Java**
Merge

Sort in Java is used to

sort integer values of an array. There are many
methods to

sort Java like bubble

sort,

insertion sort, selection

sort, etc. In
Merge

sort unsorted values are divided into two equal parts

**Sort**
Sort program to

sort a list of numbers in decendimg order
Hi Friend,
Try the following code:
import java.util.*;
class SortListInDescendingOrder{
public static void main(String[] args

**Quick Sort in Java**
Quick

sort in Java is used to

sort integer values of an array. It is a
comparison

sort. Quick

sort is one of the fastest and simplest sorting algorithm
in comparison to other sorting algorithms like bubble

sort,

insertion sort, heap

**Insertion into database**
Insertion into database Hi,
I need code for inserting the multiple select box values into database.Please do send me the code.
Thanks for ur immediate replies its helping a lot

**insertion in SQL - SQL**
insertion in SQL Hi!
Everybody... i have a

problem with sql

insertion.
When i am inserting values through command i.e.
insert into employee values(,,,,);
here i want to insert ' in employee name column of database

**dynamic delete and insertion in tables**
dynamic delete and

insertion in tables hey... i have a

problem..I am working on a

problem management system..my code for a particular jsp page... in the table named

problem..and a submit solution button besides every row..whenever

**insertion in SQL - SQL**
insertion in SQL Query is "insert into employee values('"+eno+"','"+ename+"');"
in the ename place we will get employee names such as
John's.... calrify my doubt........ Hi friend,
Code to solve the

problem
**insertion error - JSP-Servlet**
insertion error my first jsp page :
In this i m getting all the values through a method called getAllDetails,the values are getting inserted but the

problem is i have created frames , when i clicking on the link book halls

**dynamic delete and insertion in tables**
dynamic delete and

insertion in tables hey... i have a

problem..I am working on a

problem management system..my code for a particular jsp page... in the table named

problem..and a submit solution button besides every row..whenever

**bubble sort**
bubble sort how to calculate the number of passes in bubble

sort
**bubble sort**
bubble sort write a program in java using bubble

sort