Here is the draft of code that i designed. My task is here to create the matrix, allocate the dynamic memory for it, and to find the biggest sum of the column elements that is located over main diagonal. So main points is correct memory allocation, and the sorting to the biggest sum of column higher than diagonal.
View 14 RepliesHow to find the biggest column of the matrix (higher of main diagonal) Here is the draft of code that i desighned/ Of cause it has a several mistake. My task is here to create the matrix, allocate the dynamic memory for it, and to find the biggest sum of the column elements that is located over main diagonal. So main points is correct memory allocation, and the sorting to the biggest sum of column higher than diagonal.
#include<iostream>
#include<conio.h>
#include<time.h>
using namespace std;
[Code]....
How to find the arithmetic mean of each column of the matrix and find the sum of all elements of this matrix?
Given integer matrix A of size NxM. Find the arithmetic average of each column and the sum of all matrix elements of the matrix.
I made the code that stores and prints 5 row by 5 column values but how to find the largest number from them.What should I do to find the largest number?If I use if-else then it would be very tedious but I think there is way out with for loop but still I can't frame the logic. Here is the code
Code:
#include<stdio.h>
main() {
int lnum[5][5];
int i,j;
for(i=0;i<=4;i++) {
[Code] .....
I'm having this issue where my else if statements are not working. My program only works correctly when I go into my if statement and change the first part of my array to the specific row I am trying to find ex [0][i] to [1][i].
int getMonthMax(int scores[][COLS],int month){
int highestN=0,i, j;
for (i=0;i<ROWS-1;i++){
if(scores[0][i]>highestN){
highestN=scores[0][i];
[Code] .....
i want to write a program which find the biggest prime factor of a number for example the biggest prime factor of six is three or the biggest prime factor of fifteen is five. What is my program bug
Code:
#include <stdio.h> // main functions
#include <math.h> // for sqrt function
int main()
{
int i, j, k, f; // F = Flag;
printf("Enter K
[Code]...
I suppose to have the following matrix
A). I want to remove a generic row and column. For instance the second row and column, then I get
B). How can I realize it in C?How to do.
A) B)
a00 a01 a02
a00 a02
a10 a11 a12a20 a22
a20 a21 a22
I am new in c programming and my teacher gives me home word to do. the home work is to create dynamic matrix that check if i have same number in row or in column. for example the matrix
1 2 3
2 3 1
3 1 2
is legal matrix and this matrix is illegal
1 3 3
2 1 3
3 2 1
I created the matrix and sent it to function but there I don't know how build the code.
I have to prepare a project. But I don t know how can I do this. Program will find a matrix P for a square matrix A such that P^-1 A P ....
View 15 Replies View RelatedI have problem with finding the maximum value in a column. This is my code
Code:
#include <stdio.h>
#include <stdlib.h>
int main() {
FILE *fp;
fp = fopen ("C:
ocket1.txt", "r");
float time, altitude, velocity, acceleration, amax, bmax;
[Code] ....
The first loop will print out all of numbers in the velocity column. The second while loop is looking for the maximum value in that column. It is supposed to print out the max velocity in the end of the second loop. However, when I build and run the program, it's crashed. I run debugger and received "Segmentation fault" error. When I eliminate the second loop, it run just fine I use Code::Block for text editor.
The method doesn't work properly, the point of the code is to tell the minimum value in the given matrix "m", it's supposed to take the first value of the matrix store it in min_ and then compare it to every value of the matrix, if the value stored in min_ is bigger than the current value in the loop then it's stored as the new min_ and at the end it's supposed to print that minimum...
Code:
#include <stdio.h>
#include <stdlib.h>
#define SIZE 3
void minimum (int mat[SIZE][SIZE]){
int r,c;
int min_;
printf("
[Code] ......
I want to get non-singular matrix with the C++ linear algebra library eigen, but I do not know which function works.
assume that X is matrix with dimension of 100*50. I want to get (X.transpose()*X).inverse() in C++, but error is that singular matrix occurs. Multicollinearity occurs in some columns of matrix, i just want to get non-singular matrix.
Here is the matrix pivot in R software:
qr(X)$pivot
and the result is: qr(X)$pivot= 1 2 4 5 7 10 ..(11-41).. 42 45 49 50 3 6 8 9 43 44 46 47 48, that is non-singular matrix contains columns except for 3 6 8 9 43 44 46 47 48
I use Laplas to find the determinant, but the result is always 0. my code:
#include <iostream>
#define N 100
int P[N][N];
using namespace std;
[Code].....
Its a code to find the largest number of a 3X3 matrix.The logic seems to be right........
Code:
#include<stdio.h>
main() {
int matrix[3][3],i,k,j,*a;
a=&matrix[0][0];
printf("Enter the elements");
for(i=0;i<=2;i++) {
[Code]....
I've written the code for the row-wise sum of a matrix:
int rowsum=0; //row-wise sum
cout<<"Row-wise sum:"<<endl;
for (int i=0;i<m;i++) {
for (int j=0;j<n;j++) {
rowsum+=arr[i][j];
} cout<<rowsum<<endl;
rowsum=0;
}
It works fine but I can't figure out how to do the column-wise sum.
I want to find transpos of square matrix.but my program does not run complete.
Code:
#include<iostream>
using namespace std;
const int size=3;
void read(int a[size][size])
[Code] .....
given matrix A find shortest path between vertices using matrix power multiplications untill u get nonzero values,use adjacency matrix
View 1 Replies View RelatedI am really desperate on trying to make my code work. The code is to find the eigen values of any given matrix of dimension NxN. The input can be the diagonal of any NxN matrix alongwith its subdiagonal. The code works fine for N~350 or so but when i go beyond that these errors appear.
First-chance exception at 0x00425ea4 in divide.exe: 0xC0000005: Access violation writing location 0x01141000.
Unhandled exception at 0x00425ea4 in divide.exe: 0xC0000005: Access violation writing location 0x01141000.
But as i have never declared any variable statically and when i dynamically allocating memory with variables it should work like it does for smaller N values.
After trying to understand the problem i finally gave up. The problem requires me to calculate the sum of the biggest numbers in a triangle.
For example: 5
4 0
3 8 2
2 7 9 6
Here is the solved problem from the book(It uses recursion, but i do not get it at all)
#include <iostream>
#include <fstream>
using namespace std;
int triunghi[50][50], n, sum=0;
int suma_max(int i, int j);
[Code] .....
I doesn't give me the same result(26) if a change the order of the numbers in the triangle.
I'm supposed to find the biggest number (largest value), in any given array A with n numbers. (no floats)
My thoughts here are, check if A[0] > A[1]. if yes, check if A[0] > A[2]. If no, check if A[1] > A[2] etc.
I'm not sure how I can do this in code. I'm thinking if A[0] > A[1] is true, then set A[0] = A[k]. Kind of set it aside, and use that for the next if test. But I'm not sure how to do it.
This is my code so far.
Code:
int main(){
int A[7] = {12, 6, 9, 33, 2, 25, 53};
int i, k;
k = 0;
[Code]....
I'm aware of the flaws here, but this is the best I can do so far. How can I get the if test to use A[k] next, as A[k] will always be the biggest value?
I need to find inverse of a matrix data in binary file should be used to form matrix.its not finding inverse correctly rest is working good.
Code:
#include <stdio.h>
void createbin();
void display();
void inverse();
int main()
{
createbin();
display();
inverse();
[Code] ....
I got a code of a BST and i need to create a function that will return the value of the parent that it's son/sons sum to the biggest sum - BST and not AVL.
I assume that the shortest code will be recursive but i didn't manage to get it right - i'll send the code without my function because it's wrong - l
#include <vector>
#include <iostream>
using namespace std;
//-----------------------------------------------------------------
// class Node
// a single Node from a binary tree
//-----------------------------------------------------------------
template <class T> class Node
[Code] ....
i want to know how i can solve this question? do i need to create a class or write the program codes.
View 12 Replies View RelatedI just want to know the code of the program: Write code to accept matrix as aurgument and display its multiplication matrix which return its multiplication matrix.
View 1 Replies View RelatedI want to assign a matrix to submatrix of a bigger matrix.
ublas::matrix<int> A(8,5);
ublas::matrix<int> B(2,5);
for(size_t i=0;i<A.size1();++i)
for(size_t j=0;j<A.size2();++j)
A(i,j)=i*A.size2()+j+1;
for(size_t i=0;i<B.size1();++i)
for(size_t j=0;j<B.size2();++j)
B(i,j)=i*B.size2()+j+5;
ublas::matrix_range<ublas::matrix<int> > a(A,ublas::range(0,2),ublas::range(0,5));
a=B;
and it works.
but if the matrix is compressed_matrix type, there's something with it. the error log as below:
Check failed in file boost_1_48_0/boost/numeric/ublas/detail/matrix_assign.hpp at line 1078:
detail::expression_type_check (m, cm)
terminate called after throwing an instance of 'boost::numeric::ublas::external_logic'
what(): external logic
Aborted
I'm not sure this is a bug or not.
3 3
2 1 3 2 3
1 0 2
1 2 6
First line shows row and column number
First index of the second line tells the number of non-zero entries of the first row and second index tell the column number where the non zero entry is placed
for 1st row of matrix:
non-zero entries=2
column number=1
non-zero entry=3
column number=2
non-zero entry=2
covert this in the given form
0 3 3
2 0 0
0 0 6