a sort function bases on most used entries

beautifulSort.js

const MOST_USED = ["BASE", "INTERMEDI", "REJECTED", "FULL"] // ["BASE", "INTERMEDI", "REJECTED", "FULL"];
const list = ["super","base wire","base","START","PREMIUM","PLUS","Intermedi","Blocked","Advanced"] // ["REJECTED",",ciccio","FULL","INTERMEDI","BASE"]
function beautifulSort(a,b){
    const i1 = MOST_USED.indexOf(a.toUpperCase()) 
    const i2 = MOST_USED.indexOf(b.toUpperCase()) 
    
    if(MOST_USED.includes(a.toUpperCase()) && MOST_USED.includes(b.toUpperCase)){
        return i1-i2
    }
    
    if(MOST_USED.includes(a.toUpperCase()) && !MOST_USED.includes(b.toUpperCase())){
        return -1
    }

    if(!MOST_USED.includes(a.toUpperCase()) && MOST_USED.includes(b.toUpperCase())){
        return 1
    }
    
    return a<b
}
console.log(list.sort(beautifulSort)) 

/**
 * produce: -> [ 'base', 'Intermedi', 'super', 'base wire', 'START', 'PREMIUM', 'PLUS', 'Blocked', 'Advanced' ]
 */