Search found 3 matches

by quick-dudley
Sat May 10, 2014 8:17 am UTC
Forum: Computer Science
Topic: High-Base compression
Replies: 9
Views: 7481

Re: High-Base compression

This is a special case of arithmetic coding. As a simple example: imagine you have some file format that always consists of just "A", "B", and "C". You have a collection of files in this format and they have an average length of 1 Kb, 50% of the symbols are "A"...
by quick-dudley
Thu May 08, 2014 10:43 am UTC
Forum: Coding
Topic: Approximate speed classes of programming languages
Replies: 33
Views: 50563

Re: Approximate speed classes of programming languages

I'm curious about whether Haskell would benchmark better or worse if the Haskell code used in the benchmarks wasn't such a spectacular example of someone fighting against the language rather than taking advantage of its features.
by quick-dudley
Mon Mar 28, 2011 10:54 am UTC
Forum: Computer Science
Topic: Merging lists in place
Replies: 41
Views: 10718

Re: Merging lists in place

I recommend one of the in-place versions of quicksort: such as the following. If the call stack on this gets too big then you may be stuck using bubble sort void quicksort(ref int[] b, int begin, int end) { int pi = end; int ci = begin; bool homogenous = true; if(begin >= end) { return; } for(int i ...

Go to advanced search