Would the solution with time O(logn) be better than O(n)? Could you please provide input for the following solution?

class Solution {
    largestAltitude(gain) {
        let maxAltitude = 0;  
        let altChange = new Array(gain.length)
        altChange[0] = gain[0]
        for (let i=1; i< gain.length; i++){
          altChange[i] = gain[i] + altChange[i-1]
        }
        altChange.sort((a,b) => b-a)
        maxAltitude = altChange[0]
        return maxAltitude;
    }
}