Friday, July 25, 2014

Analysis of algorithms Day 01

When are you going to multiply steps and when are you going to add steps? In particular, when there is a for loop.

There are three assumptions for a random access machine.

1. Memory access time is free or constant O(1).
2. Simple operations take one step.
3. Loops count as often as they run.

No comments:

Post a Comment

Mounting USB drives in Windows Subsystem for Linux

Windows Subsystem for Linux can use (mount): SD card USB drives CD drives (CDFS) Network drives UNC paths Local storage / drives Drives form...