vseloved

10 ms·

1.
by vseloved 6y ago
Got it. Strange, that's the link google search gives me. Also, it shows me price for Ukraine (where I am)
2.
by vseloved 6y ago
Thanks for the feedback! I recognize the deficiencies of my English writing. Moreover, the current state of the book is, in fact, much-much better than the original manuscript thanks to the efforts of Dr. Robert Strandh, phoe, and Apress pr
3.
by vseloved 6y ago
sorry, can you elaborate on that? (I'm affraid I didn't understand the question)
4.
by vseloved 6y ago
there's an interesting recent video on the differences between Cl and Clojure here: https://www.youtube.com/watch?v=44Q9ew9JH_U
5.
by vseloved 6y ago
Not much. I have summarized all the updates here: http://lisp-univ-etc.blogspot.com/2021/02/programming-algori...
6.
by vseloved 6y ago
You're quite right that SICP is about the fundamentals. Progalgs is about writing efficient programs. It's for those who already understand the fundamentals.
7.
by vseloved 6y ago
thanks for the feedback!
8.
by vseloved 6y ago
In the preface, I discuss a bit the topic of how algorithms are taught in the universities versus how they are actually used. I made a choice to lean heavily towards the "practical" approach. So, from the perspective of a student,
9.
by vseloved 6y ago
More of the second: i.e. teach algorithms using Lisp. The secondary goal is to get people more accustomed with Lisp.
10.
by vseloved 6y ago
Hi, I'm the author. For those who haven't heard about the book yet: it is a practical description of the main data structures and algorithms in use today. The book is also featuring a presentation of the most important algorithm d
11.
Show HN: "Programming Algorithms in Lisp” Book(apress.com)
232 points by vseloved 6y ago|33 comments
12.
“Programming Algorithms” book with examples in Lisp(vseloved.github.io)
3 points by vseloved 6y ago|0 comments
13.
“Programming Algorithms” Paperback(lisp-univ-etc.blogspot.com)
2 points by vseloved 6y ago|0 comments
14.
by vseloved 6y ago
Yes, I plan to have a paperback version for $20+shipment. If you send me an email to vseloved@gmail.com I'll include you in the distribution (and send the details on how to pay and receive a copy in a week or two)
15.
by vseloved 6y ago
thanks for the notice (my typing habit is such that I often don't press the keys hard enough which results in missing letters - easy to see thanks to the spellcheckers when a normal word is misspelled, not so hard for personal names th
16.
by vseloved 6y ago
It depends on what you code and how. I hope the book explains some of the approaches and describes the tools that can be used to reduce that difference and avoid a tragedy :)
17.
by vseloved 6y ago
There's a pretty good overview in this writeup (which is the most recent one): https://ambrevar.xyz/modern-common-lisp/index.html
18.
A book on algorithmic programming in Lisp(leanpub.com)
141 points by vseloved 6y ago|17 comments
19.
“Programming Algorithms” Book Freely Available(leanpub.com)
3 points by vseloved 6y ago|0 comments
20.
by vseloved 7y ago
I examined Union-Find in more detail and found the critical flaw in my description that you were pointing too. Unfortunately, I forgot about it and had a simplified view of this data structure that focused on improving Find but neglected Un
21.
by vseloved 7y ago
> This doesn't mention the function slot of the symbol, so one could perhaps argue that therefore the function slot is not meant to be a constant variable Exactly > but one could equally well argue the opposite No, as variables a
22.
by vseloved 7y ago
Sorry, getting back to the initial point: can you point to a statement in the standard that forbids assigning to symbol-function of keywords or dims it unspecified behavior? I see only this: http://www.lispworks.com/document
23.
by vseloved 7y ago
thanks for pointing this out
24.
by vseloved 7y ago
> but then just assumes that computational complexity and O-notation are known. At the bottom, you can find a reference to the previously published chapters. Complexity & big-O was addressed in the initial. (This is part of a book, a
25.
by vseloved 7y ago
This was already discussed in great detail (greater than such minor thing should be) in the comments to the first and next chapter. And, by the way, Lispworks also allows it (see here: https://github.com/vseloved/rutils
26.
by vseloved 7y ago
good point, so, here, it is exactly syntax sugar as, unlike in C++, nothing else except syntax is different from the pointer-based version. Not to mention that, in the article, I was mentioning the general concept that has one (and single)
27.
by vseloved 7y ago
And here's another quote from this very much upvoted answer ( https://stackoverflow.com/a/596750/977052 ): "A reference can be thought of as a constant pointer (not to be confused with a pointer to a const
28.
by vseloved 7y ago
The point of the article is not to talk about low-level specifics of some language, apart, from, maybe, Lisp sometimes. But, surely, not C++ (although, if you could provide a link with a good and accessible explanation of the differences of
29.
by vseloved 7y ago
> Wait, what? Tuples aren't sum types, they're product types. Thanks for the correction. As I wrote in the introduction, there will be some errors in these beta-version chapters that are published on the blog (as I, obviously,
30.
by vseloved 7y ago
The idea of this book is not be a 10th version explaining the same algorithms. It is as more about how to implement those algorithms for real — production-level stuff, so to say. And pseudocode isn't an implementation language, you wil

More ›