ie:

1. com.ldoublem.loadingView.view.LVCircularCD L64, L73
2. com.ldoublem.loadingView.view.LVCircularRing L59
3. com.ldoublem.loadingView.view.LVCircularSmile L61
4. com.ldoublem.loadingView.view.LVFinePoiStar L120, L130

// Time Complexity O(n^2) // Space Complexity O(1)

fun sort(arr: Array): Array { var items = arr.copyOf() for (i in 0 .. items.size - 1) { for (j in i + 1 .. items.size - 1) { if (items[j] < items[i]) { val tmp = items[j] items[j] = items[i] items[i] = tmp } } } return items; }

var items = arrayOf(4, 1, 5, 3, 2)

val sortItems = sort(items) // sortItems is {1, 2, 3, 4, 5} sortItems.forEach { print("$it ") } println()

// *** simplified speed test *** items = Array(200, {0}) .mapIndexed { i, _ -> i } .toTypedArray() val tmp = items[5] items[5] = items[6] items[6] = tmp val count = 10000 val start = Date()

for (i in 0..count - 1) { sort(items) }

val milliseconds = Date().time - start.time

println(milliseconds) // about 2742 milliseconds

fun search(list: List, x: Long): Int { var low = 0 var high = list.size - 1

while ((list[low] < x) &amp;&amp; (x < list[high]))
{
    var mid = (low + ((x - list[low])*(high - low))/(list[high] - list[low])).toInt()

    if (list[mid] < x)
    low = mid + 1
    else if (list[mid] > x)
    high = mid - 1
    else
    return mid
}

if (list[low] == x.toInt())
return low
if (list[high] == x.toInt())
return high
return -1

}

var items = listOf(2, 3, 5, 7, 11, 13, 17)

println(search(items, 1)) //print -1 println(search(items, 7)) //print 3 println(search(items, 19)) //print -1

// *** simplified speed test ***

items = Array(1000000, {0}).mapIndexed { i, _ -> i } val count = 100

val start = Date()

for (i in 0..count-1) { search(items, 777777) }

val milliseconds = Date().time - start.time

println(milliseconds) // about 4 milliseconds