ashwinbhaskar / functional-way Goto Github PK

The quick sort implemented in the folder Scala-Way is using a mutable array. Can/Should this be done in an immutable way?

In the scala transformBST code, you have this comment: https://github.com/ashwinbhaskar/functional-way/blob/master/scala-way/src/main/scala/tree/TransformBST.scala#L3
But the tree underneath is doing something completely different.
First it is not summing nodes greater or equal, it is excluding itself. But then the two 6es should still have the same value. So what I think this does is just summing the values that are to the left, am I right?

The implementation of Heap sort under Scala-Way is using a mutable array. Even though the mutable array is private and is only accessible through a few public methods, I think there are ways of implementing it in an immutable way - using braun trees?

The current Scala version used in Scala-Way is 2.12.8. With dotty entering feature freeze, now could be good time to try the migration. Try to see which features of dotty can be incorporated in the repo other than the obvious ones (indentation syntax, main launcher etc)

Hello there,

this is not really an issue. FWIW I just wanted to show the Scala equivalent of https://github.com/ashwinbhaskar/functional-way/blob/master/haskell-way/src/QuickSort.hs.

I came across it here: https://www.slideshare.net/pjschwarz/ad-hoc-polymorphism-using-type-classes-and-cats#2

Cheers.

The scala-way folder has property based testing using Scala Check. But I am not sure about how to go about with property based testing for Clojure in the folder Clojure-Way.