The following are some general computer science aspects to know when working with SharePoint administration and development:
Algorithm
Complexity, Design, & Analysis – be it best case, worst case and average case scenarios in
problem solving.
Big-O
notations – run time complexity as memory requirements grow based on the input size growing.
Hashtables – how
they are a data structure, much
like an array, except that each value is stored using a key.
Recursions – a function being defined by its
own definitions.
Sorting althorithms – way of rearranging an array or list in a
more usable fashion. Common sorts are: bubble, heap merge and quick.
Tree sorts – way of traversing elements to place them in
order. Common tree sorts are: AVL (Adelson-Velsky and Landis), binary, red/black
and splay tree.
