In this presentation I'll introduce the audience to a big picture view of asymptotic complexity (Big O) in scripting, using a language that doesn't require a CS degree, then look at some common pitfalls when it comes to runtime inefficiency that I've seen in actual scripts in the wild and on the internet, and finally dig into how one might spot and resolve these terribly slow anti-patterns. The theme of the talk is not entirely original, as I believe others (including Ashley McGlone?) has previeously delivered presentations on this topic, but I'd like to dig a little deeper into the behavior of different collection types in .NET, look at practical examples of how one might infer the time complexity of a piece of code using an augmented version of [Measure-Script](https://github.com/IISResetMe/Measure...) and finally focus on more general patterns of efficient abstractions with the [PSCache module](https://github.com/IISResetMe/PSCache) as a starting point
Get notified about new features and conference additions.