http://grimore.i2p/fuss/lsl?amp;=
When the list is already sorted (the sorted parameter being TRUE ), the time complexity is O(n) since the algorithm traverses the list only once. Call: wasListUnique ( [ 1 , 1 , 2 , 1 , 3 , 1 , 5 , 2 , 2 , 2 , 7 , 8 ] , FALSE ) Return: [1, 2, 3, 5, 7, 8] /////////////////////////////////////////////////////////////////////////// // Copyright (C) 2012 Wizardry and Steamworks - License: GNU GPLv3 //...