We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Warmup
  4. Birthday Cake Candles
  5. Discussions

Birthday Cake Candles

  • bertgayus + 1 comment

    if you use quicksort u already have O(nlogn) which is worse than just iteratring through the array and saving the highest value and then just iterate a second time incrementing a counter everytime the value is similar to the saaved one. then complexity is O(2n) = O(n). With n = 100 you would have ~ 600 steps(n*logn = 100 * 6 = 600) with your solution and just 200 steps with mine

    • Alex_Marble + 1 comment

      Wouldn't it be faster to maintain your count in the initial iteration? 

      
    static int birthdayCakeCandles(int[] ar) {
        int height = ar[0];
        int count = 1;
        for (int i = 1; i < ar.Count();i++)
        {
            if (ar[i] > height){
                height = ar[i];
                count = 1;
            }
            else if (ar[i] == height){
                count++;
            }
        }
        return count;
    }
      • Sachith_M + 1 comment

        Yes for this one it looks easy to use initial ... I was wondering about using the bubble sort for all kinds these qs..
        Thank you for this code Its great

        • Alex_Marble + 1 comment

          Bubblesort i believe averages O(n^2), so i believe quicksort will generally be faster. For most of the questions on here its likely not worth using a sort as the benefits wouldn't be seen on only one use of the data. I think Linq is probably a better choice then a sort in this scenario but im not 100% sure.

          • Sachith_M + 0 comments

            yeah I agree with that.. Thanks bro.. :)