All sorting routines use 'loops'. Replacement sort, bubble sort, Quick sort, Binary Tree sort, Selection sort, Merge sort whatever algorithm. Unless you are using an SQL database, you must use loops to sort. Some 'looping' is more 'efficient' than others.
JavaScript is a programming language .. it too has loops.
What is faster? It depends on where the sorting takes place; on the Android, with its minimal cpu or on a server somewhere.
JavaScript is not a sorting algorithm. Is a Javascript sorting algorithm faster than AI2 blocks? Selection and Insertion sorts are slow ...what someone recommended here; however a bubble sort in AI2 will be faster.
Try the methods, and report back? You want a fast sort, don't sort on an Android but use it to access a server.
Regards,
Steve