This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440018 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Consider a magic square matrix. A magic square is an n x n square matrix containing unique positive integers, where the sum of elements of every row and every column is same. Additionally, sum of elements on each of the main diagonals is also the same. Given a n x n matrix, what is the time complexity to find whether that matrix is magic square or not .

    Options :-

    1. O(n3)
    2. O(nlogn)
    3. O(n2)
    4. O(n)
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider a magic square matrix. A magic square is an n x n square matrix containing unique positive ….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account