« first day (2477 days earlier)      last day (1072 days later) » 

12:01 AM
REFRESH!
 
RELOAD!
[rubberduck-vba/Rubberduck] 2 opened issues. 6 issue comments.
[Minesweeper] Games Played: 105, Bombs Used: 78, Moves Performed: 13509, New Users: 12
 
 
4 hours later…
4:24 AM
@SimonForsberg do you feel the same way about BigO notation as well?
 
 
2 hours later…
 
3 hours later…
10:13 AM
@IvenBach I think that it's good to be able to reason about BigO without needing to implement things. If you implement something and you call list.contains(i); inside a loop, what's the BigO-notation of that?
 
10:51 AM
@SimonForsberg that depends on the implementation of the list... it could be O(n log n) or O(n^2)
 
@Vogel612 My point exactly.
It's easy to make the mistake when implementing something and thinking about the code that "It's one for-loop and it's one operation inside the loop, so therefore it's O(n)"
 
11:05 AM
waves
 
11:43 AM
Wow. I was just told to shove a stack inserter up my buffer chest in the Factorio group. Internet is a lovely place today.
I wish I had both a stack inserter and a buffer chest, but in my current PyBlock run I have neither.
 
 
1 hour later…
1:00 PM
Wow ahahah that;s nice creative way to say that ahaha
Hi everyone! Friday is here! Have a nice day
 
 
1 hour later…
[Zomis/Games/PR-203] build 27 Build failed.
 
[Zomis/Games] build for commit 6ee3e07c on renovate/major-dependencies--major: This commit cannot be built
BUILD FAILURE!
 
 
1 hour later…
3:19 PM
[Zomis/Games] renovate-bot pushed commit 2397030b to renovate/kotlin: Update kotlin to v1.5.0
> [![WhiteSource Renovate](https://app.renovatebot.com/images/banner.svg)](https://renovatebot.com)

This PR contains the following updates:

| Package | Change | Age | Adoption | Passing | Confidence |
|---|---|---|---|---|---|
| org.jetbrains.kotlin.multiplatform:org.jetbrains.kotlin.multiplatform.gradle.plugin | `1.4.32` -> `1.5.0` | [![age](https://badges.renovateapi.com/packages/maven/org.jetbrains.kotlin.multiplatform:org.jetbrains.kotlin.multiplatform.gradle.plugin/1.5.0/age-slim)](https:
 
[Zomis/Games/PR-243] build 1 Build failed.
 
[Zomis/Games] build for commit 2397030b on renovate/kotlin: This commit cannot be built
BUILD FAILURE!
 
 
1 hour later…
4:24 PM
That would depend on the implementation.
Because of the loop for i = 0 to Foo.Length - 1 that's making it a O(n) by nature of the loop.
Then, depending on the access time of the data structure, it's access time is factored in.
In the case of a Linked-List O(m) is the access/index time. This results in O(n * m).
In the case of a Hashset O(1) is the access time resulting in O(n).
 
In the case of a B-tree O(log m) is access time resulting in O(n log(m)).
@SimonForsberg @Vogel612 ^ That's the point I've arrived to in my knowledge.
 
sounds about perfectly correct
 
The distinction in variables n and m is what I needed to see myself to fully understand it.
Future self-homework-assignment is to implement and understand each of the data structures and their access times.
 
well, the nice thing about m is that it's usually only useful if it's relatable to n (usually by showing that it's smaller than n), allowing a simplification
 
4:38 PM
Otherwise it's considered a worst case where they are both the same size?
 
[Zomis/Games/PR-203] build 28 Build failed.
 
[Zomis/Games] build for commit c15eb1b2 on renovate/major-dependencies--major: This commit cannot be built
BUILD FAILURE!
 
 
3 hours later…
[Zomis/Games/PR-199] build 14 Build failed.
 
[Zomis/Games] build for commit e79dc797 on renovate/aws-java-sdk-monorepo: This commit cannot be built
BUILD FAILURE!
 
 
2 hours later…
10:37 PM
 

« first day (2477 days earlier)      last day (1072 days later) »