849 reputation
49
bio website
location
age
visits member for 2 years, 6 months
seen Nov 24 at 14:44

Oct
12
answered What was the influence of Chris Okasaki's data structures on Scala?
Oct
11
revised Best way to handle language interoperability
edited title
Oct
10
comment Best way to handle language interoperability
@svick I am not completely sure what you mean. Type providers don't really provide the same functionality as higher-order modules or typeclasses.
Oct
10
revised Best way to handle language interoperability
edited title
Oct
10
asked Best way to handle language interoperability
Oct
4
awarded  Scholar
Oct
4
accepted Alternative to language purity
Oct
3
awarded  Student
Oct
3
revised Alternative to language purity
added 642 characters in body
Oct
3
comment Alternative to language purity
Well, the main point is that it would be more transparent to the programmer, making it easier to swallow for some people. Syntax wise it would be a very small addition - and the semantics would be a simple extension of the type system. That being said, I am not sure if it is advantageous or not
Oct
3
revised Alternative to language purity
edited title
Oct
3
asked Alternative to language purity
May
12
awarded  Yearling
Nov
3
comment Finding the order of a set's elements
@MaciejStachowski The number of comparisons and the asymptotic running time is essentially identical. If we compared every single element to each other, we would have O(n^2) comparisons - what is interesting to note, on the other hand, is that the best of these algorithms use less comparisons than this. Hence, we don't even need to compare each element. A more detailed analysis will further show that mergesort uses approximately 1/4 the number of comparisons of heapsort and avg. case quicksort - in practice the other algorithms are almost always just as fast or faster though.
Nov
3
comment Finding the order of a set's elements
@rwong In practise, the cost of swaps might have some influence on the speed - the same goes for lots of other things, like CPU cache behavior and so on. However, the asymptotic running time is calculated from the number of comparisons in all case - hence, insertion sort will still only be good for small arrays.
Nov
2
revised Finding the order of a set's elements
added 795 characters in body
Nov
2
answered Finding the order of a set's elements
May
12
awarded  Yearling
Mar
31
comment Format text in a generic and reusable way
Obviously, Markdown is very easily read. Still, I do find XML rather easy to actually read/write if structured appropriately. Nevertheless, there certainly is some kind of conflict between structure and minimalism (readability). If you can live the features that Markdown supports, it should be OK to use it -> after all, it is rather easily converted to XML either way. But it seems the main problem is the editing/collaboration part - reading is easily done when converted into something else. Maybe even the correct choice of editor/tools would remedy the problems to some extend.
Mar
30
answered Format text in a generic and reusable way