Outer loop: Iterate i from 0 to 1 (for each row). Inner loop: Iterate j from 0 to 2 (for each column within the current row). Step 5.1: In each iteration of the inner loop, take input from the user ...

Learn C Programming with me. Contribute to insaanehacker/Learn-C-Programming- development by creating an account on GitHub.

If you are only searching once, its probably a waste of time to sort an unsorted array and then binary search it. <BR><BR>If they aren't sorted, just search through by hand using nested for loops.

This way we can print the pascal's triangle using 2D array correctly because it is often confused by multiple of 11 which is not a correct method and it will not support after 5 rows.