1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
{-# OPTIONS_CYMAKE -Wno-overlapping #-}
module Sort( sort, sortBy, sorted, sortedBy
, permSort, permSortBy, insertionSort, insertionSortBy
, quickSort, quickSortBy, mergeSort, mergeSortBy
, cmpChar, cmpList, cmpString
, leqChar, leqCharIgnoreCase, leqList
, leqString, leqStringIgnoreCase, leqLexGerman
) where
import Char
import Test.Prop
sort :: Ord a => [a] -> [a]
sort = sortBy (<=)
sort'post :: Ord a => [a] -> [a] -> Bool
sort'post xs ys = length xs == length ys && sorted ys
sort'spec :: Ord a => [a] -> [a]
sort'spec xs = permSort xs
sortBy :: (a -> a -> Bool) -> [a] -> [a]
sortBy = mergeSortBy
sorted :: Ord a => [a] -> Bool
sorted = sortedBy (<=)
sortedBy :: (a -> a -> Bool) -> [a] -> Bool
sortedBy _ [] = True
sortedBy _ [_] = True
sortedBy leq (x:y:ys) = leq x y && sortedBy leq (y:ys)
permSort :: Ord a => [a] -> [a]
permSort = permSortBy (<=)
permSortBy :: Eq a => (a -> a -> Bool) -> [a] -> [a]
permSortBy leq xs | ys == perm xs && sortedBy leq ys = ys where ys free
perm :: [a] -> [a]
perm [] = []
perm (x:xs) = insert (perm xs)
where insert ys = x : ys
insert (y:ys) = y : insert ys
insertionSort :: Ord a => [a] -> [a]
insertionSort = insertionSortBy (<=)
insertionSort'post :: Ord a => [a] -> [a] -> Bool
insertionSort'post xs ys = length xs == length ys && sorted ys
insertionSort'spec :: Ord a => [a] -> [a]
insertionSort'spec = permSort
insertionSortBy :: (a -> a -> Bool) -> [a] -> [a]
insertionSortBy _ [] = []
insertionSortBy leq (x:xs) = insert (insertionSortBy leq xs)
where
insert [] = [x]
insert zs@(y:ys) | leq x y = x : zs
| otherwise = y : insert ys
quickSort :: Ord a => [a] -> [a]
quickSort = quickSortBy (<=)
quickSort'post :: Ord a => [a] -> [a] -> Bool
quickSort'post xs ys = length xs == length ys && sorted ys
quickSort'spec :: Ord a => [a] -> [a]
quickSort'spec = permSort
quickSortBy :: (a -> a -> Bool) -> [a] -> [a]
quickSortBy _ [] = []
quickSortBy leq (x:xs) = let (l,r) = split x xs
in quickSortBy leq l ++ (x : quickSortBy leq r)
where
split _ [] = ([],[])
split e (y:ys) | leq y e = (y:l,r)
| otherwise = (l,y:r)
where (l,r) = split e ys
mergeSort :: Ord a => [a] -> [a]
mergeSort = mergeSortBy (<=)
mergeSort'post :: Ord a => [a] -> [a] -> Bool
mergeSort'post xs ys = length xs == length ys && sorted ys
mergeSort'spec :: Ord a => [a] -> [a]
mergeSort'spec = permSort
mergeSortBy :: (a -> a -> Bool) -> [a] -> [a]
mergeSortBy leq zs = mergeLists (genRuns zs)
where
genRuns [] = []
genRuns [x] = [[x]]
genRuns (x1:x2:xs) | leq x1 x2 = [x1,x2] : genRuns xs
| otherwise = [x2,x1] : genRuns xs
mergeLists [] = []
mergeLists [x] = x
mergeLists (x1:x2:xs) = mergeLists (merge leq x1 x2 : mergePairs xs)
mergePairs [] = []
mergePairs [x] = [x]
mergePairs (x1:x2:xs) = merge leq x1 x2 : mergePairs xs
merge :: (a -> a -> Bool) -> [a] -> [a] -> [a]
merge _ [] ys = ys
merge _ (x:xs) [] = x : xs
merge leq (x:xs) (y:ys) | leq x y = x : merge leq xs (y:ys)
| otherwise = y : merge leq (x:xs) ys
leqList :: Eq a => (a -> a -> Bool) -> [a] -> [a] -> Bool
leqList _ [] _ = True
leqList _ (_:_) [] = False
leqList leq (x:xs) (y:ys) | x == y = leqList leq xs ys
| otherwise = leq x y
cmpList :: (a -> a -> Ordering) -> [a] -> [a] -> Ordering
cmpList _ [] [] = EQ
cmpList _ [] (_:_) = LT
cmpList _ (_:_) [] = GT
cmpList cmp (x:xs) (y:ys) | cmp x y == EQ = cmpList cmp xs ys
| otherwise = cmp x y
leqChar :: Char -> Char -> Bool
leqChar = (<=)
cmpChar :: Char -> Char -> Ordering
cmpChar = compare
leqCharIgnoreCase :: Char -> Char -> Bool
leqCharIgnoreCase c1 c2 = (toUpper c1) <= (toUpper c2)
leqString :: String -> String -> Bool
leqString = (<=)
cmpString :: String -> String -> Ordering
cmpString = compare
leqStringIgnoreCase :: String -> String -> Bool
leqStringIgnoreCase = leqList leqCharIgnoreCase
leqLexGerman :: String -> String -> Bool
leqLexGerman [] _ = True
leqLexGerman (_:_) [] = False
leqLexGerman (x:xs) (y:ys) | x' == y' = leqLexGerman xs ys
| otherwise = x' < y'
where
x' = glex (ord x)
y' = glex (ord y)
glex o | o >= ord 'A' && o <= ord 'Z' = o + (ord 'a' - ord 'A')
| o == 228 = ord 'a'
| o == 246 = ord 'o'
| o == 252 = ord 'u'
| o == 196 = ord 'a'
| o == 214 = ord 'o'
| o == 220 = ord 'u'
| o == 223 = ord 's'
| otherwise = o
|