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.
You can't get better than O(n^2), the goal is to print an nxn matrix where some of the elements are spaces and some are #. In order to do that you have to do at least the n^2 print statements.
Just because you can code it in a few lines in a language like C# doesn't mean it's more efficient, that same process is going on behind the scenes.
Staircase
You are viewing a single comment's thread. Return to all comments →
brute force
What?! Because it's not convoluted crap it's brute force? Only silly thing is that he started indices at 0 instead of 1.
It's not the most efficient at O(n^2)
You can't get better than O(n^2), the goal is to print an nxn matrix where some of the elements are spaces and some are #. In order to do that you have to do at least the n^2 print statements.
Just because you can code it in a few lines in a language like C# doesn't mean it's more efficient, that same process is going on behind the scenes.
yes,bro it you are saying correct...it will minimum require of O(n^2) time complexity
static void staircase(int n) {
string str = ""; for (int i = 0; i < n; i++) { str += "#"; Console.Write(str.PadLeft(n,' ')+"\n"); }
agreed - no need for 2 nested loops