It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.3K All Categories
- 104.2K Programming Languages
- 6.3K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 3 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 502 Python
- 47 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 308 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 519 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 253 XML Development
- 3.2K Classifieds
- 189 Co-operative Projects
- 169 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 598 Jobs Wanted
- 196 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 352 Comments on this site
- 56 Computer Emulators
- 1.7K General programming
- 136 New programming languages
- 598 Off topic board
- 156 Mobile & Wireless
- 30 Android
- 124 Palm Pilot
- 334 Multimedia
- 151 Demo programming
- 183 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 363 MS-DOS
- 0 Shell scripting
- 318 Windows CE & Pocket PC
- 4.1K Windows programming
- 876 Software Development
- 401 Algorithms
- 67 Object Orientation
- 81 Project Management
- 88 Quality & Testing
- 232 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 221 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 282 WEB Servers
- 107 WEB-Services / SOAP

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

elika91
Posts: **1**Member

in Algorithms

This is an exercise from my Informatics course:

Create an algorithm which finds if the minimum of two diagonals is the

same element of a square matrix with N x N elements.

I have no problem with creating the algorithm, once I find the correct

interpretation of the exercise.

The professor doesn't give any further clues.

I thought of these interpretation possibilities (assuming the first

diagonal is [a11,a22,a33,a44,a55...ann] and the second is [a1n,

a2(n-1), a3(n-2)...an1] ) :

1- Find the minimum of the first diagonal and then the second's and

compare them if they have the same value.

2- Do the same as above, but also check if they are the same element

(same indexes) which means if they are the intersecting element for

the two diagonals. This would work only if N would be an odd number.

If N is an even number the diagonals don't intersect.

3- Find the minimum of all elements of the two diagonals "joined"

together. Then find the minimum of the matrix. Check if they have the

same value.

4- Do the same as above, but also check if the minimum for both the

diagonals is the same element with the minimum of the matrix (check if

they have the same indexes).

What's your opinion? Judging by the way the exercise is expressed

which interpretation could me more possible? If there is any other

interpretation possible, what is it?

Thanks in advance.

Create an algorithm which finds if the minimum of two diagonals is the

same element of a square matrix with N x N elements.

I have no problem with creating the algorithm, once I find the correct

interpretation of the exercise.

The professor doesn't give any further clues.

I thought of these interpretation possibilities (assuming the first

diagonal is [a11,a22,a33,a44,a55...ann] and the second is [a1n,

a2(n-1), a3(n-2)...an1] ) :

1- Find the minimum of the first diagonal and then the second's and

compare them if they have the same value.

2- Do the same as above, but also check if they are the same element

(same indexes) which means if they are the intersecting element for

the two diagonals. This would work only if N would be an odd number.

If N is an even number the diagonals don't intersect.

3- Find the minimum of all elements of the two diagonals "joined"

together. Then find the minimum of the matrix. Check if they have the

same value.

4- Do the same as above, but also check if the minimum for both the

diagonals is the same element with the minimum of the matrix (check if

they have the same indexes).

What's your opinion? Judging by the way the exercise is expressed

which interpretation could me more possible? If there is any other

interpretation possible, what is it?

Thanks in advance.

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.