Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Learning F# Functional Data Structures and Algorithms
  • Table Of Contents Toc
Learning F# Functional Data Structures and Algorithms

Learning F# Functional Data Structures and Algorithms

By : Adnan Masood
4 (9)
Buy this Book
close
close
Learning F# Functional Data Structures and Algorithms

Learning F# Functional Data Structures and Algorithms

4 (9)
By: Adnan Masood
Buy this Book

Overview of this book

If you have just started your adventure with F#, then this book will help you take the right steps to become a successful F# coder. An intermediate knowledge of imperative programming concepts, and a basic understanding of the algorithms and data structures in .NET environments using the C# language and BCL (Base Class Library), would be helpful.
Table of Contents (12 chapters)
close
close
close
Preface
Icon
Preface
Icon
What this book covers
Icon
What you need for this book
Icon
Who this book is for
Icon
Conventions
Icon
Reader feedback
Icon
Customer support
Lock Free Chapter
1
1. Embrace the Truth
Icon
1. Embrace the Truth
Icon
Exploring the functional programming paradigm
Icon
Thinking functional – why functional programming matters
Icon
A historical primer of F#
Icon
The Hello World example
Icon
A brief F# language primer
Icon
Syntactical similarities and differences
Icon
Benefits of using F# over C#
Icon
Summary
2
2. Now Lazily Get Over It, Again
Icon
2. Now Lazily Get Over It, Again
Icon
Setting up the IDE
Icon
Your first F# project
Icon
Talk is cheap, show me some code
Icon
To understand recursion, you must understand recursion
Icon
Memoization with Fibonacci
Icon
Towers of Hanoi
Icon
Sorting lazily
Icon
F# 4.0 – new features
Icon
Summary
3
3. What's in the Bag Anyway?
Icon
3. What's in the Bag Anyway?
Icon
Exploring data structures in F#
Icon
F# implementation of sorting algorithms
Icon
Algorithmic complexity and the Big-O notation
Icon
Summary
4
4. Are We There Yet?
Icon
4. Are We There Yet?
Icon
Diving deep into enumerations and sequences
Icon
Enumerating a CSV file
Icon
Query expressions
Icon
Creating sequences from collections
Icon
Usage considerations for sequences
Icon
Summary
5
5. Let's Stack Up
Icon
5. Let's Stack Up
Icon
Let's build a stack
Icon
Stack with concurrency support
Icon
Testing the stack
Icon
Algorithm – parenthesis matching using stacks
Icon
Summary
6
6. See the Forest for the Trees
Icon
6. See the Forest for the Trees
Icon
Tree as a data structure
Icon
The binary search tree
Icon
Navigating the tree
Icon
Abstract syntax trees
Icon
Summary
7
7. Jumping the Queue
chevron up
Icon
7. Jumping the Queue
Icon
Let's make a functional queue
Icon
The FSharpx.Collections library
Icon
Summary
8
8. Quick Boost with Graph
Icon
8. Quick Boost with Graph
Icon
Graphs
Icon
Modeling graphs using F#
Icon
The shortest path algorithm
Icon
Finding the minimal path sum
Icon
Summary
9
9. Sets, Maps, and Vectors of Indirections
Icon
9. Sets, Maps, and Vectors of Indirections
Icon
Sets and maps
Icon
Vectors
Icon
F# and the Intermediate Language
Icon
Summary
10
10. Where to Go Next?
Icon
10. Where to Go Next?
Icon
References and further readings
Icon
F# language resources
Icon
Component design guidelines
Icon
Functional programming guides
Icon
Books and interactive tutorials
Icon
Video tutorials
Icon
Community projects – development tools
Icon
Community projects – functional programming
Icon
Community projects – data science programming
Icon
Community projects – the GPU execution
Icon
General functional programming
Icon
Academic resources
Icon
Summary
11
Index
Icon
Index

Let's make a functional queue

Following Okasaki's lead, we design our first functional queue by using two stacks. One stack will be used to to store the data, while the second stack will be used for temporary storage for the dequeue operation.

Note

Cornell's CS3110 Recitation 7 on Functional stacks and queues, dictionaries, fractions is an informative and recommended reading on functional data structures. For more information, go to www.cs.cornell.edu/Courses/cs3110/2011sp/recitations/rec07.htm.

In the following algorithm, you will see this data structure unfold. Let StackQ be the stack in which we store the data, and let StackTemp be a temporary data structure.

The Enqueue operation is essentially just a stack push.

Enqueue(o):
  StackQ.push(o)

However, the dequeue operation requires a bit more work. While dequeueing, we pop items off the StackQ until we get to the bottom (first-entered) element, using stackTemp as a temporary store which conveniently gives back the items in the correct order...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Learning F# Functional Data Structures and Algorithms
End of Section 7
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon