[interface]

Dropsort - stratny algorytm sortowania

This paper presents the Dropsort algorithm and suggests improvements. Dropsort is a simple comparison sorting algorithm that performs in O(n) time by simply removing those elements that are not already in the correct order. Because of this, it is not a true sorting algorithm as the output does not contain all the elements of the input. In other words it is a lossy “sorting algorithm”

http://micsymposium.org/mics_2011_proceedings/mics2011_submission_13.pdf

#interfacesmieci
#humorinformatykow

[sorhu]

@interface
W najgorszym przypadku usunie n-1 elementów. ( ͡° ͜ʖ ͡°)

[FNwsk]

@interface, @sorhu:
Najfajniejsze jest to, że wygląda na to, że rzeczywiście może być przydatny.

[FNwsk]

@interface @sorhu:
Co sądzicie o rozwinięciu podsekcji 4.1?

4.1 Performance

...

Consider a case where a large amount of data to be sorted exists in a flat text file.

Dropsort when sorting the lines in the file must only delete a row. Other sorting

algorithms require that lines be deleted, stored, and inserted into another place in the file

– often many times. This is more difficult in a text file