How to verify Sorting Functionality

function Sortingverify()
{
var rowlength= _eval("ds$('tbody tr').length");

log(rowlength);
var i=0;
var arr1 =[];
var arr2 = [];
while (i <= rowlength-1){
var cellClassName = "slds-truncate uiOutputTextArea["+ i +"]";
assertExists(span(cellClassName));
arr1.push(getText(span(cellClassName)));
i = i+2;
}
log(arr1.length);
for(var j=0;j<arr1.length;j++){
arr2.push(arr1[j]);

}
log(arr2.length);
if(arr2.length > 0){
sortCheck(arr2);
}

function sortCheck(arr){

var c1=0,c2=0,i,c3=0;

for (i=0;i<((arr.length)-1);i++){
log(arr[i]);
log(arr[i+1]);

if(arr[i] < arr[i+1]) {
c1++;
log("c1 value is"+c1);
}

else if(arr[i] > arr[i+1]) {
c2++;
log("c2 value is"+c2);
}
else if(arr[i] == arr[i+1]) {
c3++;
log("c3 value is"+c3);
}

}
if(arr.length == 1){
log("Only one row exists.");
}
else if(c3>=0 && c2>=1)

log("Descending order.");

else if(c3>=0 && c1>=1)

log("Ascending order");

else
log("All are same value");

}
}