-
My comment to an entry 'Управление мета-классами в MatLab' by green_fr
Это не арифметическое сравнение. Это отношение порядка (частичного) на множестве классов. Как-то так...
View the entire thread this comment is a part of
-
code/pre test
code/pre
break/continue -
Practicing Our Craft
Find two bugs in the following binary search implementation:
func search(arr []int, target int) int {
l := 0
r := len(arr) - 1
for l < r {
m := (l + r) / 2
if target < arr[m] {
r = m - 1
} else {
l = m
}
}
if arr[l] == target { //assume len(arr) != 0
return l
}
return -1
}None of this is Golang specific. If you know Java, C or ( Read more... ) -
Tales from the Loop Artist
https://www.simonstalenhag.se/index.html
Couple of people told me they were not quite sure they got the plot of these visual stories. To that I said: there is some plot in there but not too much of it. Either this art speaks to you or it doesn't... -
Prefix Tree vs Hash Table
Prefix trees are known as an alternative implementation for dictionaries/maps. Applied like this, they sometimes significantly outperform hash tables. In particular, it works well when key space consists of thousands not-very-long strings. I saw this in action as a part of a smart order router code at a big sell-side firm where the keys were US ( Read more... ) -
Turing Completeness
Unconventional take on Turing completeness: https://www.quora.com/Does-a-programming-language-have-to-be-Turing-complete/answer/Andrii-Melnykov?share=77ae4ec9&srid=uCFpz.
And a little more of the same in Russian: https://nponeccop.livejournal.com/588087.html#comments.
