Question

Write a ML language function stripmin of type int list -> int list that will return a list from which every instance of the lowest value has been removed.

Here are a few examples of expected behavior: - stripmin [1,0,2,3,0,5]; val it [1,2,3,5] : int list - stripmin [1,0,2,3,0,5,~3]; val it [1,0,2,3,0,5] : int list - stripmin []; no Lowest item, so I guess there's nothing to do? * val it [: int list

Hints:

• Only stripmin itself should be visible at the top level;

•You should have two recursive helper functions tucked away inside a let … in … end; structure

• Also include a val to avoid having to pass a value that never changes to one of these functions.

• Use appropriate pattern matching in your parameters.

• The efficiency of the solution is O(n).

Answer 1

fun remove_element (elemlist, elem) =
case elemlist of
[] => []
| head::tail => if elem = head
then remove_element (tail, elem)
else head::remove_element (tail, elem)

fun stripmin list = remove_element(list, minimum(list))

try this code and get your answer

here minimum is the inbuilt function in some of the machines otherwise use below minimum function

fun minimum(xs)=
   case xs of
       [] => NONE
   | (head::[]) => SOME head
   | (head::neck::rest) =>   if head < neck
                   then minimum (head::rest)
                   else minimum (neck::rest)

then you will get exact answer

but it look like while using minimum function it will be O(n²) if it is inbuilt then the answer will be in O(n)