Granville Barnett - All Comments

Book review: F# for Technical Computing

DotNetKicks.com — Sat, 30 Jan 2010 19:09:10 GMT

You've been kicked (a good thing) - Trackback from DotNetKicks.com

F# Discoveries This Week 01/29/2010

Rick Minerich's Development Wonderland — Fri, 29 Jan 2010 19:16:30 GMT

Many apologies if I missed your post. Having skipped last week due to some uncontrollable circumstances

re: Book Review: F# for Technical Computing

Jay Garfield — Mon, 18 Jan 2010 16:35:34 GMT

I agree its full of good content, but at around $200 USD ($125 GBP), its very expensive!

re: Book Review: F# for Technical Computing

Art Scott — Mon, 18 Jan 2010 12:52:14 GMT

I agree.

I enjoy the transformation in thinking that using FUNctional languages brings ... and Jon's thinking is sharp.

re: Shared Source CLI (aka Rotor) on Vista

Brian Hartung — Tue, 24 Nov 2009 02:09:22 GMT

Sadly, I can report that I corresponded directly with one of the authors of the Rotor book and he confirmed that it has gone the way of the dodo. He referred to it as a an example of the Law of 2 Feet in action...nobody cared enough about Rotor to keep it alive, so it died. Sigh. On the bright side, they just announced the .NET 4.0 Micro Framework will be released under GNU...so it's not all doom and gloom...

heh..

DesFlestetymn — Fri, 17 Apr 2009 03:13:29 GMT

nice, really nice!

re: Data Structures and Algorithms book flying out (again!)

Granville Barnett — Thu, 08 Jan 2009 03:54:13 GMT

Hi newbie (although I has a feeling thats not your name ;-)),

All the source code for the book is the book itself. The examples given can be translated relatively friction free to your respective imperative language of choice. However, if you want an implementation then we have one on offer in the DSA CodePlex project - http://codeplex.com/dsa which is all done in C#.

HTH

re: Data Structures and Algorithms book flying out (again!)

newbie — Wed, 07 Jan 2009 18:43:33 GMT

Hi,

Where can you download the source code for the book?

Thanks

Dew Drop - January 7, 2009 | Alvin Ashcraft's Morning Dew

Dew Drop - January 7, 2009 | Alvin Ashcraft's Morning Dew — Wed, 07 Jan 2009 15:14:18 GMT

Pingback from Dew Drop - January 7, 2009 | Alvin Ashcraft's Morning Dew

re: Data Structures and Algorithms book flying out (again!)

Granville Barnett — Wed, 24 Dec 2008 11:32:07 GMT

Hi Phil,

I'll recheck the algorithm when I have some time (which is hard to find these days).

Thanks.

Data Structures and Algorithms

Think Before Coding — Wed, 24 Dec 2008 10:22:29 GMT

I had a peek through Jon Skeet’s blog this morning at a free eBook called Data Structures and Algorithms by Granville Barnett and Luca Del Tongo. The book is clear and presents the usual linked lists, trees, sets structures in a concise yet precise

re: Data Structures and Algorithms book flying out (again!)

Phil Duby — Tue, 23 Dec 2008 21:46:55 GMT

Chapter 5: Sets; Intersection

While traversing the smallerset, there is no need to check if the smallerset contains the item. That is already known, or it would not have been found during the traversal. Syntax adjusted to use what this form allows.

1) algorithm Intersection(set1, set2)

2) Pre: set1, and set2 not 1 emptySet

3) intersection, smallerSet and largerSet are sets

3) Post: An intersection of set1, and set2 has been created

4) if set1.Count < set2.Count

5) smallerSet is set1

6) largerSet is set2

7) else

8) smallerSet is set2

9) largerSet is set1

10) end if

11) foreach item in smallerSet

12) if largerSet.Contains(item)

13) intersection.Add(item)

14) end if

15) end foreach

16) return intersection

17) end Intersection

Alternative,

1) algorithm Intersection(set1, set2)

2) Pre: set1, and set2 not 1 emptySet

3) intersection is a set

3) Post: An intersection of set1, and set2 has been created

4) if set1.Count < set2.Count

5) foreach item in set1

6) if set2.Contains(item)

7) intersection.Add(item)

8) end if

9) end foreach

10) else

11) foreach item in set2

12) if set1.Contains(item)

13) intersection.Add(item)

14) end if

15) end foreach

16) end if

17) return intersection

18) end Intersection

Dew Drop - December 22, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - December 22, 2008 | Alvin Ashcraft's Morning Dew — Mon, 22 Dec 2008 14:50:37 GMT

Pingback from Dew Drop - December 22, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - December 19, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - December 19, 2008 | Alvin Ashcraft's Morning Dew — Fri, 19 Dec 2008 15:39:07 GMT

Pingback from Dew Drop - December 19, 2008 | Alvin Ashcraft's Morning Dew

Arjan`s World » LINKBLOG for December 19, 2008

Arjan`s World » LINKBLOG for December 19, 2008 — Fri, 19 Dec 2008 15:16:57 GMT

Pingback from Arjan`s World » LINKBLOG for December 19, 2008

Reflective Perspective - Chris Alcock » The Morning Brew #248

Reflective Perspective - Chris Alcock » The Morning Brew #248 — Fri, 19 Dec 2008 08:40:01 GMT

Pingback from Reflective Perspective - Chris Alcock » The Morning Brew #248

re: Data Structures and Algorithms book (free) first preview available!

Deepak Kumar — Tue, 09 Dec 2008 10:22:19 GMT

Thanks 4 provide Data structures and Algorithms ebook

Dew Drop - November 11, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - November 11, 2008 | Alvin Ashcraft's Morning Dew — Tue, 11 Nov 2008 13:42:07 GMT

Pingback from Dew Drop - November 11, 2008 | Alvin Ashcraft's Morning Dew

re: Code Contracts – my opinion on them anyway...

TraumaPony — Tue, 11 Nov 2008 01:28:01 GMT

I agree. I'd definitely like to see it included in pre/post/invariant keywords like in Spec#, but for the time being, this is better than nothing.

QUT HIGH FIVE

re: Design Patterns – Part 5 published

Granville Barnett — Thu, 09 Oct 2008 10:51:50 GMT

@Costin - no problems, I'm just glad someone finds them useful! ;-)