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. Prepare
  2. Algorithms
  3. Warmup
  4. Staircase
  5. Discussions

Staircase

  • mustafaalp04q
     + 0 comments

    Here is my solution in C (I know could be better) time complexity: O(n^2)

    void staircase(int n) {

    int m = 0;

for(int i = 1 ; i <= n ; i++)
{
    m++;
    for(int j = 0 ; j < n - i ; j++)
    {
        printf(" ");
    }

    for(int k = 0 ; k < m ; k++)
    {
        printf("#");
    }

    printf("\n");
}

    }