## Computational Complexity

Instead of analysing the complexity of a given algorithm, e.g. Bubble Sorts complexity of O(n²) or Heap Sort's complexity of O(n log n) »

Instead of analysing the complexity of a given algorithm, e.g. Bubble Sorts complexity of O(n²) or Heap Sort's complexity of O(n log n) »

This report will try to show how Dijkstra’s algorithm can be applied in medicine, in particular how Verscheure et al show in their paper ‘Dijkstra's »

Representation in Bits A floating point number is called floating point, because its point can float while expressing the number using scientific notation. 0.1 can »

In case you read about Alan Turing’s work on Turing Machines and the Halting Problem and asked yourself what a turing machine is and what »