Sure.

In general, the SDD syllabus mainly covers algorithms through

1. The forms in which they are represented.

2. Standard Algorithms.

In terms of how they are represented, in the syllabus, this refers to pseudocode, flowchart diagrams, EBNF and railroad diagrams. Understanding how these work and how to create them help to overall understand algorithms as a whole as these representations are often used to convert into actual code and vice versa.

With standard algorithms, i.e the five searches (selection, linear, bubble etc), these have code already provided in the course specifications or various textbooks (Samuel Davis / Heineman) You don't have to memorise these codes, as you can simply understand the concept through which the algorithm works and create your own based on that.

When I studied these algorithms, what I did was create a visual representation of the algorithm I'm trying to learn. For example, I would create a flowchart or a DFD or a railroad diagram of a, say a bubble sort, based on the algorithm provided through the course specifications. I would then convert this into my own code, in pseudocode. This encourages you to understand the process of the algorithm, as you need to in order to simplify it or create your own version of it.

With recognising particular questions and their suitability to certain algorithms, again it really comes down to your understanding of how various aspects of an algorithm works. If you really understand how they work, you'll be able to automatically pick up parts of the question that you can recognise as part of a standard algorithm and or determine the effectiveness/suitability of an algorithm to a question.

For example, in terms of sorts, a selection or insertion sort is inefficient in long arrays with lots of elements as these sorts go through each item in an array, either once or multiple times. Instead, ~~a bubble sort~~ a binary search is much more suited to longer arrays since it splits the array into two, and disregards the other half, provided that conditions are met.

There isn't really a "best' method for this. It really depends on how you learn. This is a method that worked for me, and I hope for you as well.

Resources I recommend:

Grok learning (If your school offers it)