functional-data-structures

所属分类:数据结构
开发工具:Haskell
文件大小:0KB
下载次数:0
上传日期:2023-12-06 15:14:51
上 传 者sh-1993
说明:  这个紧凑但健壮的实现探索了函数编程上下文中数据结构的使用,特别是在Haskell中。
(This compact yet robust implementation explores the utilization of data structures in the context of functional programming, specifically within Haskell.)

文件列表:
etapa1/ (0, 2023-12-06)
etapa1/BinaryNumber.hs (8664, 2023-12-06)
etapa1/NouBinaryNumber.hs (7858, 2023-12-06)
etapa1/SkelBinaryNumber.hs (5423, 2023-12-06)
etapa1/TestBinaryNumber.hs (6388, 2023-12-06)
etapa1/TestPP.hs (19443, 2023-12-06)
etapa2/ (0, 2023-12-06)
etapa2/BinomialHeap.hs (11768, 2023-12-06)
etapa2/TestBinomialHeap.hs (21255, 2023-12-06)
etapa2/TestPP.hs (19443, 2023-12-06)

# Haskell Binomial Heap Welcome to the Haskell Binomial Heap repository! Explore the world of functional programming with Haskell and dive into the realm of binomial trees and heaps. This project is a journey into the application of functional mechanisms, types, and lazy evaluation, offering you a hands-on experience in building a priority queue. ## Objectives - Apply functional programming mechanisms, including types and lazy evaluation in Haskell. - Delve into the efficiency of data structures in a functional paradigm. ## Overview This project unfolds in three stages, each building on the knowledge gained in the previous weeks. From binary numbers to binomial heaps, you'll discover the beauty of functional solutions. ### Stage 1: Binary Numbers Get ready by tackling operations on binary numbers. The BinaryNumber module introduces concepts like converting between binary and decimal, incrementing, decrementing, and multiplying binary numbers. ### Stage 2: Binomial Heaps In this stage, immerse yourself in the world of binomial trees and heaps. Discover how to efficiently implement a priority queue using binomial heaps. From inserting elements to finding the minimum priority and merging heaps, this stage will sharpen your functional programming skills. ## Getting Started 1. **Stage 1**: Navigate to the BinaryNumber module, complete the TODOs, and run tests using TestBinaryNumber. 2. **Stage 2**: Head to the BinomialHeap module, tackle the TODOs, and test your implementations using TestBinomialHeap. Feel the power of functional programming and witness the elegance of Haskell in action. Happy coding!

近期下载者

相关文件


收藏者