[英]SML - Can't find where "uncaught exception Empty" is thrown in quicksort algorithm
我正在尝试在不使用任何 List.nth 函数的情况下编写快速排序算法。 我想出了这个,但是当我尝试测试它时,它最终抛出了一个“未捕获的异常空”。 我似乎无法找到引发此异常的位置。 这是我的代码:
(*returns last element in list*)
fun last (h::nil) = h
| last (h::lst) = last(lst)
| last _ = ~1;
(*returns middle element in list*)
fun middle (lst) =
let
fun middle_rec (_ :: []) (x :: _) = x
| middle_rec (_ :: _ :: []) (x :: _) = x
| middle_rec (_ :: _ :: xs) (_ :: ys) = middle_rec xs ys
| middle_rec _ _ = ~1
in
middle_rec lst lst
end;
(*return median of three elements*)
fun median(a,b,c) =
if ((b>a andalso a>c) orelse (c>a andalso a>b)) then a
else if ((a>b andalso b>c) orelse (c>b andalso b>a)) then b
else if ((a>c andalso c>b) orelse (b>c andalso c>a)) then c
else ~1;
(*partitions a list with one containing elements smaller than or equal to p and one with elements greater than p*)
fun partition([], p) = ([], [])
| partition(lst, p) =
let
fun part_rec ([], x::xs, y::ys, p) = (x::xs, y::ys)
| part_rec (lst, x, y, p) =
if hd(lst) <= p then part_rec(tl(lst), hd(lst)::x, y, p)
else part_rec(tl(lst), x, hd(lst)::y, p)
in
part_rec(lst,[],[],p)
end;
(*quicksort function*)
fun quicksort [] = []
| quicksort(x::xs) =
let
val (left, right) = partition(x::xs, median(x, middle(x::xs), last(x::xs)))
in
quicksort left @ [x] @ quicksort right
end;
quicksort([9, 4, 7, 2, 8, 5, 1, 6, 4, 3]);
让我们逐步分析一个非常简单的数据集:
quicksort([1]);
val (left, right) = partition([1], median(1, middle([1]), last([1])))
val (left, right) = partition([1], median(1, 1, 1))
val (left, right) = partition([1], ~1)
val (left, right) = part_rec([1], [], [], ~1)
val (left, right) = part_rec([], [], [1], ~1)
这里有一个问题。
fun part_rec ([], x::xs, y::ys, p) = (x::xs, y::ys)
| part_rec (lst, x, y, p) =
if hd(lst) <= p then part_rec(tl(lst), hd(lst)::x, y, p)
else part_rec(tl(lst), x, hd(lst)::y, p)
第一个模式不能应用,因为第二个参数是一个空列表,因此不能与x::xs
匹配,所以必须应用第二个模式。 但是,这意味着在空列表上调用hd
,这将引发Empty
异常。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.