Data Structure

• Stores and organizes data so that it can be used efficiently
• http://en.wikipedia.org/wiki/Data_structure

Algorithm

• Procedure or formula for solving a problem
• Finite series of computational steps to produce a result
• Independent from any programming language
• Examples for basic algorithms: sorting and searching
• Brute force algorithm: performs an exhaustive search of all possible solutions

Complexity

• Measure of the difficulty of constructing a solution to a problem
• Estimate of the number of operations needed to execute an algorithm

Big O notation

• Asymptotic notation
• Estimates the worst case performance of data structures and algorithms
• http://en.wikipedia.org/wiki/Big_O_notation

Introductory Example

Calculating the sum of all numbers ≤ n

#include <stdint.h>
// Return the sum of all values from 1 to n.
uint64_t add_to(uint32_t n) {
    uint64_t sum = 0;
    for (uint32_t i = 1; i <= n; ++i) {
        sum += i;
    }
    return sum;
}

What is wrong with the above naive implementation?

The asymptotic performance is $O(n)$

$O(1)$ - Constant Time Implementation

#include <stdint.h>
// Return the sum of all values from 1 to n.
uint64_t add_to(uint32_t n) {
    return (uint64_t) ((n / 2.0 * n) + (n / 2.0));
}

Which impact can $O(1)$ vs $O(n)$ have?

clang sum_to.c -o sum_to
time ./sum_to n
time ./sum_to 1

Why Are Algorithms More Important Than Ever?

Despite computers being faster than ever, why are data structures and algorithms still important, even more so than in the past?

Because computers have to deal with larger amounts of data.

Computation time costs energy

• Analyzes the worst case memory usage/ runtime of algorithms
• Big O provides an upper bound
• History
  • First introduced by number theorist Paul Bachmann in 1894
  • Popularized in the work of number theorist Edmund Landau (Landau symbol)
  • Donald Knuth popularized the notation in computer science

Problem Classes

• Constant
• Logarithmic
• Linear
• Loglinear
• Polynomial
• Exponential
• Factorial

Orders of Common Problem Classes

Basic Rules

• The fastest sorting algorithms log-linear $O(n\ast \log n)$
• For pre-sorted data, performance may even be linear
• Multiple sorting algorithms exist:
  • Bubble sort - $O(n^2)$
  • Merge sort - $O(n\log n)$
  • Quicksort - $O(n\log n)$
  • Timsort - $O(n\log n)$
  • ...

Bubble Sort

Repeatedly step through the list, compare adjacent elements and swaps them

Bubble sort animation

Bubble-sort with Hungarian ("Csángó") folk dance

Exercise: implement the bubble sort algorthm
void bsort(int* array, size_t cnt)

Although simple, it is not used in practice due to the slow $O(n^2)$ performance.

qsort

In practice, don't implement your own search. Use the standard library.

#include <stdio.h>
#include <stdlib.h> // qsort
int compare (const void * a, const void * b) {
  return ( *(int*)a - *(int*)b );
}
int main () {
  int values[] = { 33, 12, 99, 90, 7, 45 };
  qsort (values, 6, sizeof(int), compare);
  for (size_t n=0; n<6; ++n) {
     printf ("%d ",values[n]);
  }
  printf("\n");
  return 0;
}