Algorithms?? (1 Viewer)

[pfft]

Are we required to know how to write algorithms for like selection sort, insertion sort, bubble sort, etc??

i'm finding it hard to write up a selection sort

 

[Graceofgod]

Are we required to know how to write algorithms for like selection sort, insertion sort, bubble sort, etc??

i'm finding it hard to write up a selection sort

This was asked earlier. It is best if you could write one up in an exam.

You should at least be able to destiguish between the three sorts and be able to write up the two searches.

 

[Fly Kite]

insertion and selection and bubble are pretty hard
iive no idea how to write insertion a little about selection and most of bubble

 

[yoyojuan]

I have been told by my teacher that you don't have to be able to write one one the spot, but you have to be able to tell what one is by reading it. It is obvous that it would be better if you could though.

 

[spoonbender]

I've been told that the only ones you need to be able to replicate are Linear and Binary search. You would, however, need to know how the others work and be able to recognise them when reading the algorithm.

Don't quote me on it though.

 

[Interdrama]

bubble sort:

BEGIN bubbleSort
	set counter = 1
	set end = last index of array

	WHILE end>1
		counter=1
		WHILE counter < last
			IF thearray[current] > thearray[current+1] THEN
				temp=thearray[current]            //swaps the two 
				thearray[current]=thearray[current+1]
				thearray[current+1]=temp


				
			END IF
			increment counter
		ENDWHILE
		decrement end	
	ENDWHILE
END

i'm still learning how to make the swap a function though D: ... test on tuesday morning

EDIT: OMG TOMORROW

i just learnt the insertion sort, which i just learnt

BEGIN MAINPROGRAM
set first to 1
set last to 100
set positionofnext to last -1 
WHILE  positionofnext => first         //until there is no longer unsorted part
	next = thearray[positionofnext]
	current = positionofnext
	WHILE current<last and thearray[current]>thearray[current+1]
		increment current
		thearray[current-1]=thearray[current]
	ENDWHILE
	thearray[current]=next
	decrement positionofnext                        //reduces unsorted part by 1
ENDWHILE
END MAINPROGRAM