/** * Binary Sort Revised Algorithm
* using javascript
* Written by: Dixanta Bahadur Shrestha
* Creators Institute of Business & Technology
* https://creators.institute
* https://www.facebook.com/creators.ibt
*/ This works exactly like a binary search but for sorting, we compare with first and previous and compare if needed to swap or not, if the last number is lesser than previous one we rearrange values of Array. Happy Coding.
Programming Language: Javascript
dataset=[2,3,4,15,-1,13,12,6,7,8];
end=dataset.length;
for(var i=1;i<end;i++)
{
if(dataset[i]<dataset[i-1])
{
for(var j=0;j<i;j++){
if(dataset[i]<dataset[j]){
temp=dataset[i];
dataset[i]=dataset[j];
dataset[j]=temp;
}
}
}
}
console.log(dataset);
function binarySort(dataset,start,end){
if(start<end){
if(dataset[start]<dataset[end]){
for(var j=0;j<i;j++){
if(dataset[i]<dataset[j]){
temp=dataset[i];
dataset[i]=dataset[j];
dataset[j]=temp;
}
}
}
binarySort(dataset,start+1,end);
}
}
binarySort(dataset,0,dataset.length);
