-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…
-
> [04:17:14] +Dumcord: Hey, quick question. Which is more efficient? `DataStore#getClaimAt` or `DataStore#getClaim` (edited)
[04:18:34] +Dumcord: It just seems like `DataStore#getClaim` iterates th…
-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…
-
Big-O : Big O is a formal notation that describes the behaviour of a function when the argument tends towards the **maximum** input.
> As it reaches the right, it means it takes longer time. N …
-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…
-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…
-
1. Brainstorming and Mind Mapping
![image](https://user-images.githubusercontent.com/49828361/60489540-30138c80-9cd7-11e9-8232-c375ad40d764.png)
![image](https://user-images.githubusercontent.c…
-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…
-
For finite difference approximation of a derivative, a big O notation appears. The residual part (the error terms) is equal to `O(delta_x^n)` where `n` is the order of finite difference approximation.…
-
```
Caliper should support an estimate of complexity in Big O notation. Maybe done
through a particular runner, caliper could display what it guesses the
performance of your algorithm will be e.g.
…