Enter the vast world of programming languages by following the tutorials provided here to learn about functional programming in Haskell.
Create a function that takes in a list and an element, and checks whether that element is a member of that list. For example,
member [1,2,3] 3
should return true.
Create a function that sorts a list based on buble sort. To understand the algorithm see this. For example,
bsort [1,4,3,1,5,5,2,3,30]
should return
[1,1,2,3,3,4,5,5,30]
Create a function that removes duplicates from a list. (Hint: You might want to use your implementation of bubble sort in this). For example,
removal [1,4,3,1,5,5,2,3,30]
should return
[1,2,3,4,5,30]