Can someone tell me exactly which sorts/seaches we need to know? (1 Viewer)

[Popo Nana]

As far as I know, we only need to know Linear and Binary Searches, and Insertion, Selection and Bubble Sorts. This doesn't seem like a huge amount to remember - are these the only searches and sorts we need to know (and indeed know an algorithm to describe the processes)?

 

[aerialsprite]

binary and linear search and bubble, insertion and selection sorts...i think

 

[Freedom_Dragon]

Popo Nana,
You'll have to expect the worst, really they can give you anything
and ur expected to know it.
Just some suggestions.

* Learn all of the algorithms ( Searchs & Sorts)
may also include the string ( a data type consist of characters eg:- a key on the keyboard such as "A") manipulation.
It includes
Concatenation(adding 2 strings),
Insertion(inserting a string into another string),
Extraction(extracting a section of a string) &
Deletion( deleting sections of strings).
* Practice alot of algorithms & the diifferent types of scenarios/situations
* Really know & understand the deep concepts & be able to rewrite the algorithms.

But according to info from sources i dont think they will expect
you to write algorithms sorts, although you will need to identify
the different types of sorts. Altogether what im really saying is that its best if u go prepared ( Try to know all ur stuff)

 

[Freedom_Dragon]

As an addition to ur knowlegde, these are some algorithms i have
written for the "String Manipulation"

* Concatenation

Function Concatenate(String 1,String 2)
lenght 1=Strlenght(String 1)
lenght 2=Strlenght(String 2)
FOR
index<= 1 To lenght 1
Newstring(index)=String 1(index)
ENDFOR
FOR
index2<=1 To length2
Newstring(Length1+index2)=String2(index2)
ENDFOR
Newstring=Concatenate
END Concatenate

* Deletion

Function Delete(Astring,Start,Finish)
length 1=Strlenght(Astring)
temp 1=Extract(Astring,1,Start-1)
temp 2=Extract(Astring,Finish+1,lenght 1)
Newstring=concatenate(temp 1,temp 2)
Return Newstring
END Deletion

* Extract

Function Extract(Astring,Start,Finish)
IF Finish is >Strlength(Astring) THEN
Return error
ENDIF
Index=1
FOR
Position=Start To Finish
Newstring (Index)=Astring (Position)
Index=Index+1
ENDFOR
Newstring=Extract
END Extract

* Insertion

Function Insert(String1,String2,Start)
Length1=Strlength(String1)
Temp1=Extract(String1,1,Start-1)
Temp2=Extract(String1,Start,Length1)
Newstring=concatenate(Temp1,String2)
Newstring=concatenate(Newstring,Temp2)
Return Newstring
END Insert

 

[Freedom_Dragon]

Oh and these algorithms i think are not perfect, but if
u produce something like that then u should be fine.

 

[Fosweb]

If they ask you to write an algorithm in an exam dragon, dont write this. Write algorithms in english and not in Code...

Popo Nana: Linear and Binary Search.
Bubble, Selection and Insertion

They can ask you to write an algorithm on any of these sorts, but the only one i think they would actually do this for is the Bubble sort, as the others get 'slightly' more complicated. Just be aware of the swapping routine in each of them.


There are a few other threads on this stuff, hit the search button and also look for them.

 

[Popo Nana]

Thanks very much everyone, especially Freedom_Dragon for providing those algos.

I started doing an algorithm out of the Excel book, where you needed to generate 1000 random numbers, store them and sort them, and I thought that a bubble sort would be the least effective method, and thus started doing a selection sort. I'm sure that it'd be easy to figure out how to do them in an exam, so long as you understand the logic behind them, but I was mainly worried about whether you'd have to write them. Identification is easy.

Once again, thanks a bunch guys. I'll go check those other topics.

 

[Freedom_Dragon]

Not a prob Popo Nana.
Always glad to help.

To be honest i suffer alot with algorithms,probably more than u.
I usually memorise most of my algorithms and modify it according
to a given scenarios.

 

[Skywalker]

Originally posted by Freedom_Dragon
But according to info from sources i dont think they will expect
you to write algorithms sorts

HSC Exam 2002
The users of the remote terminals produce end-of-day reports listing the number
of tickets sold for each event. The TICKET and EVENT files will be numerically
sorted by ticket number and event number prior to processing.
Write an algorithm to produce a report. The algorithm must:

sort the array by event number; and

I don't think you should be telling people what not to study if you don't know what's in the paper.

 

[Freedom_Dragon]

Very true
-------------------------------------------------------------------------------
Originally posted by Freedom_Dragon
But according to info from sources i dont think they will expect
you to write algorithms sorts
------------------------------------------------------------------------------

These are just suggestion and prediction, but i could be wrong.