No but at least that makes it theoretically possible smirk

Question

Hullaballoonatic · Answer

Are you good at lambdas I m not the best at them and I m wondering if something I want to do is possible using them

karelpeeters · Answer

I don t think this is possible unfortunately the main distinguishing part of lambda sis that they re enclosed in ` `

Hullaballoonatic · Answer

oh it was something else

karelpeeters · Answer

Yeah I meant as it at least it s now theoretically possible to add it as a language feature

Hullaballoonatic · Answer

i m studying for my algorithms final and practicing kotlin by writing all the algorithms in kotlin and anywho There are a couple sorting algorithms that make use of other types of sorting algorithms namely bucket sort and radix sort which requires an in order sorting algorithm of your choice So I m trying to find the best way to make a nice radix sort function that you pass your desired sort method into as a parameter

Hullaballoonatic · Answer

maybe a sealed class is my best bet

karelpeeters · Answer

Does it absolutely need to be `infix` etc Why can t you just take a normal block like `sorter list MutableList lt T gt gt Unit`

Hullaballoonatic · Answer

sorry this is unrelated to the infix thing

Hullaballoonatic · Answer

how might i put restrictions on that sorter to functions that do stable sorts I guess the only way is to use classes

karelpeeters · Answer

You can have an interface `Sorter` and then another interface `StableSorter Sorter` with stricter requirements for the `fun lt T gt sort list MutableList lt T gt ` function

Hullaballoonatic · Answer

haha yeah that s what i did

Hullaballoonatic · Answer

however it seems ugly to pass a whole instantiated class into the function

karelpeeters · Answer

Well you can make your `Sorter` implementations `object`s

karelpeeters · Answer

```object MergeSorter StableSorter fun lt T gt sort list MutableList lt T gt ```

karelpeeters · Answer

I don t remember if mergesort is stable stuck out tongue

Hullaballoonatic · Answer

it is

Hullaballoonatic · Answer

the two fastest sorting methods quick sort and heap sort are both unstable with pretty much everything being stable

Hullaballoonatic · Answer

which makes sense tbh

Hullaballoonatic · Answer

stability has a cost

karelpeeters · Answer

Didn t mergesort have the same `O log n ` as the others

Hullaballoonatic · Answer

yeah but then you gotta get into average cases

Hullaballoonatic · Answer

of course many sorting methods are better than others if you know the data you re already working with

Hullaballoonatic · Answer

like insertion sort takes just n time if the data is already sorted

Hullaballoonatic · Answer

i might actually be wrong about merge and quick sorts actually it s easy to mix them up sometimes thinking face

Dico · Answer

I think it s O n log n < karelpeeters>

karelpeeters · Answer

My bad of course it can t be faster than `O n ` simple smile

Dico · Answer

Also I learned today you could do this ``` interface Sorter List lt Any gt Comparator lt in Any gt gt Unit ``` or something like that Actually I guess there aren t lamba functions with type parameters I was trying to introduce a constraint there I guess it doesn t work then

Dico · Answer

Someone mentioned it in this channel I think

karelpeeters · Answer

Huh that s unfortunate

Hullaballoonatic · Answer

Yeah that would have been great