Book Image

Learning F# Functional Data Structures and Algorithms

By : Adnan Masood
Book Image

Learning F# Functional Data Structures and Algorithms

By: Adnan Masood

Overview of this book

Related Content you might be interested in

Current Title:

Small book image
Learning F# Functional Data Structures and Algorithms
Adnan Masood
Jun, 2015 | 206 pages
No titles found
Table of Contents (21 chapters)
Learning F# Functional Data Structures and Algorithms
Learning F# Functional Data Structures and Algorithms
Credits
Credits
Foreword
Foreword
Foreword
Foreword
Foreword
Foreword
About the Author
About the Author
Acknowledgments
Acknowledgments
About the Reviewers
About the Reviewers
www.PacktPub.com
www.PacktPub.com
Preface
Preface
Free Chapter
1
Embrace the Truth
Embrace the Truth
Exploring the functional programming paradigm
Thinking functional – why functional programming matters
A historical primer of F#
The Hello World example
A brief F# language primer
Syntactical similarities and differences
Benefits of using F# over C#
Summary
2
Now Lazily Get Over It, Again
Now Lazily Get Over It, Again
Setting up the IDE
Your first F# project
Talk is cheap, show me some code
To understand recursion, you must understand recursion
Memoization with Fibonacci
Towers of Hanoi
Sorting lazily
F# 4.0 – new features
Summary
3
What's in the Bag Anyway?
What's in the Bag Anyway?
Exploring data structures in F#
F# implementation of sorting algorithms
Algorithmic complexity and the Big-O notation
Summary
4
Are We There Yet?
Are We There Yet?
Diving deep into enumerations and sequences
Enumerating a CSV file
Query expressions
Creating sequences from collections
Usage considerations for sequences
Summary
5
Let's Stack Up
Let's Stack Up
Let's build a stack
Stack with concurrency support
Testing the stack
Algorithm – parenthesis matching using stacks
Summary
6
See the Forest for the Trees
See the Forest for the Trees
Tree as a data structure
The binary search tree
Navigating the tree
Abstract syntax trees
Summary
7
Jumping the Queue
Jumping the Queue
Let's make a functional queue
The FSharpx.Collections library
Summary
8
Quick Boost with Graph
Quick Boost with Graph
Graphs
Modeling graphs using F#
The shortest path algorithm
Finding the minimal path sum
Summary
9
Sets, Maps, and Vectors of Indirections
Sets, Maps, and Vectors of Indirections
Sets and maps
Vectors
F# and the Intermediate Language
Summary
10
Where to Go Next?
Where to Go Next?
References and further readings
F# language resources
Component design guidelines
Functional programming guides
Books and interactive tutorials
Video tutorials
Community projects – development tools
Community projects – functional programming
Community projects – data science programming
Community projects – the GPU execution
General functional programming
Academic resources
Summary
Index
Index

Credits

Author

Adnan Masood, Ph.D.

Reviewers

Steve Bearman

Taha Hachana

Marcin Juraszek

Rohit Pathak

Commissioning Editor

Kunal Parikh

Acquisition Editor

Shaon Basu

Content Development Editor

Rahul Nair

Technical Editor

Parag Topre

Copy Editors

Relin Hedly

Sonia Mathur

Project Coordinator

Nidhi Joshi

Proofreaders

Stephen Copestake

Safis Editing

Indexer

Monica Ajmera Mehta

Graphics

Disha Haria

Jason Monteiro

Production Coordinator

Nilesh R. Mohite

Cover Work

Nilesh R. Mohite

Previous Section
Next Chapter