DaniWeb Forum Index > Software Development > C++

C++ RSS

How to do Insertion Sort?

Please support our C++ advertiser: Intel Parallel Studio Home

•

Join Date: Sep 2008

Posts: 12

Reputation: swbuko is an unknown quantity at this point

Solved Threads: 0

swbuko

Offline

Newbie Poster

How to do Insertion Sort?

Sep 19th, 2008

I've got an array BM[] with a length of 5. How would I declare my function in the heading and what am I doing wrong in my code, it keep giving me errors. Also I dont know how to apply it to my program to do the sorting. Like would I write cout<<insertionSort(BM[])<<endl;

I need help, I'm kinda new to C++

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
insertionSort(array BM[])
    for i = 1 to length[BM]-1 do
	{
        value = BM[i]
        j = i-1
        while (j >= 0 && BM[j] > value)
		{
            BM[j + 1] = BM[j]
            j = j-1
		}
        BM[j+1] = value
	}
insertionSort(array BM[])
    for i = 1 to length[BM]-1 do
	{
        value = BM[i]
        j = i-1
        while (j >= 0 && BM[j] > value)
		{
            BM[j + 1] = BM[j]
            j = j-1
		}
        BM[j+1] = value
	}

Last edited by Narue; Sep 19th, 2008 at 4:24 pm. Reason: added code tags

•

Join Date: Sep 2008

Posts: 273

Reputation: Sci@phy will become famous soon enough

Solved Threads: 42

Sci@phy

Offline

Posting Whiz in Training

Re: How to do Insertion Sort?

Sep 19th, 2008

Try with something easy for start.

•

Join Date: Sep 2008

Posts: 12

Reputation: swbuko is an unknown quantity at this point

Solved Threads: 0

swbuko

Offline

Newbie Poster

Re: How to do Insertion Sort?

Sep 19th, 2008

•

Originally Posted by Sci@phy

Try with something easy for start.

Well I have to do Insertion Sort or my program will run too slow; can you help me with learning how to do Insertion Sort?

•

Join Date: Jan 2008

Posts: 3,831

Reputation: VernonDozier has a reputation beyond repute

Solved Threads: 501

VernonDozier VernonDozier is offline

Offline

Senior Poster

Re: How to do Insertion Sort?

Sep 19th, 2008

Here's a good link from Narue on many sorts, including the Insertion Sort. Go about 1/3 of the way down to find the Insertion Sort segment. It's an efficient sort on data that's mostly sorted already, but not so great for random lists. Narue explains on the link. An array of length 5 is pretty small, so any sort will work well on it.

http://eternallyconfuzzled.com/tuts/...t_sorting.aspx

This code:

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
insertionSort(array BM[])
for i = 1 to length[BM]-1 do
{
value = BM[i]
j = i-1
while (j >= 0 && BM[j] > value)
{
BM[j + 1] = BM[j]
j = j-1
}
BM[j+1] = value
}
insertionSort(array BM[])
for i = 1 to length[BM]-1 do
{
value = BM[i]
j = i-1
while (j >= 0 && BM[j] > value)
{
BM[j + 1] = BM[j]
j = j-1
}
BM[j+1] = value
}

isn't valid C++ code. You need brackets surrounding the function implementation, you need parentheses in your for-loop declaration, and you have a do and a while, but it isn't in the form of a do-while loop. Also, what is length ? I'm not sure what language this is.