Big-O

Time & space complexities of different-different alogrithms and data structure operations.

用户数7K

评分4.8

评论数6

Manifest 版本V3

7日增长-1K

7日增长率-12.5%

视觉预览

Big-O 媒体预览

4 项素材

趋势

30 日用户趋势

查看最近 30 天的用户变化。

用户增长趋势

评分趋势

30 日评分变化

按时间查看评分波动，辅助判断近期口碑是否稳定。

30 日评分变化

起始值

4.83

日/周/月增长表现

同口径展示 1 天、7 天、30 天的绝对增长与增长率。

1日增长持平

00%

7日增长减少

-1K-12.5%

30日增长减少

-1K-12.5%

技术摘要

版本、语言与抓取信息

查看发布时间、版本、支持语言、最近更新和抓取时间。

版本0.0.1

ManifestV3

大小259KiB

语言数1English (United States)

发布时间--

插件简介

查看插件说明、主要功能和适用场景。

Big-O helps aspiring software developers remember the time and space complexities of different programming algorithms and various other data structure operations.

Now, you must be wondering how ?

Well, it randomly shows a name of the algorithm or name of the data structure operation along with it's worst case time and space complexity.

You can also check that how good or bad a complexity is in the options section, just right click on the Big-O icon and then click on options.

By this, it becomes a fun and easy way to remember complexities of different programming paradigm.

And we all know how important it becomes to have a good grip on various algorithmic complexities specially when you have a coding interview scheduled nearby.

评价