No, but at least that makes it theoretically possi...
# announcementsk
karelpeeters
12/04/2018, 6:30 PMNo, but at least that makes it theoretically possible 😏
h
Hullaballoonatic
12/04/2018, 6:35 PMAre 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
k
karelpeeters
12/04/2018, 6:36 PMI don't think this is possible unfortunately, the main distinguishing part of lambda sis that they're enclosed in
{}h
Hullaballoonatic
12/04/2018, 6:36 PMoh, it was something else
k
karelpeeters
12/04/2018, 6:37 PMYeah I meant as it "at least it's now theoretically possible to add it as a language feature".
h
Hullaballoonatic
12/04/2018, 6:40 PMi'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
12/04/2018, 6:40 PMmaybe a sealed class is my best bet...
k
karelpeeters
12/04/2018, 6:47 PMDoes it absolutely need to be
infixsorter: (list: MutableList<T>) -> Unith
Hullaballoonatic
12/04/2018, 6:48 PMsorry this is unrelated to the infix thing!
Hullaballoonatic
12/04/2018, 6:49 PMhow might i put restrictions on that sorter to functions that do stable sorts? I guess the only way is to use classes
k
karelpeeters
12/04/2018, 6:51 PMYou can have an interface
SorterStableSorter: Sorterfun <T> sort(list: MutableList<T>)h
Hullaballoonatic
12/04/2018, 6:57 PMhaha, yeah, that's what i did
Hullaballoonatic
12/04/2018, 6:58 PMhowever it seems ugly to pass a whole instantiated class into the function
k
karelpeeters
12/04/2018, 6:59 PMWell you can make your
Sorterkarelpeeters
12/04/2018, 6:59 PM Copy code
object MergeSorter: StableSorter {
fun <T> sort(list: MutableList<T>) { ...}
}karelpeeters
12/04/2018, 7:00 PM(I don't remember if mergesort is stable 😛 )
h
Hullaballoonatic
12/04/2018, 7:00 PMit is!
Hullaballoonatic
12/04/2018, 7:01 PMthe two fastest sorting methods, quick sort and heap sort, are both unstable, with pretty much everything being stable
Hullaballoonatic
12/04/2018, 7:02 PMwhich makes sense, tbh
Hullaballoonatic
12/04/2018, 7:02 PMstability has a cost
k
karelpeeters
12/04/2018, 7:02 PMDidn't mergesort have the same
O(log(n))h
Hullaballoonatic
12/04/2018, 7:03 PMyeah, but then you gotta get into average cases
Hullaballoonatic
12/04/2018, 7:04 PMof course, many sorting methods are better than others if you know the data you're already working with
Hullaballoonatic
12/04/2018, 7:05 PMlike insertion sort takes just n time if the data is already sorted....
Hullaballoonatic
12/04/2018, 7:06 PMi might actually be wrong about merge and quick sorts actually. it's easy to mix them up sometimes 🤔
d
Dico
12/05/2018, 8:32 AMI think it's O(n log(n)) @karelpeeters
k
karelpeeters
12/05/2018, 8:33 AMMy bad of course it can't be faster than
O(n)d
Dico
12/05/2018, 8:37 AMAlso, I learned today you could do this:
Copy code
interface Sorter : (List<Any>, Comparator<in Any>) -> UnitDico
12/05/2018, 8:38 AMSomeone mentioned it in this channel I think
k
karelpeeters
12/05/2018, 8:39 AMHuh that's unfortunate.
h
Hullaballoonatic
12/07/2018, 1:56 AMYeah, that would have been great
2 Views