登录
首页 » Visual C++ » FindMax

FindMax

于 2010-10-12 发布 文件大小:1KB
0 199
下载积分: 1 下载次数: 16

代码说明:

  求矩阵的最大值 有一个整型二维数组,大小为m行n列,要求分别找出其中最大值所在的行和列,以及该矩阵中的最大值。 要求: 1.编写自定义函数MaxVal 函数的原型为:int MaxVal(int arr[][N], int *m, int *n) 功能: 数组中最大元素的值通过MaxVal函数的返回值传递给主函数,最大元素的行值和列值分别通过m和n传递给主程序相应的变量。 2.main主函数的功能 (1)变量定义 (2)输入数组各元素的值 (3)以二维矩阵形式输出数组中各元素的值 (4)调用MaxVal函数,或者insert函数 (5)输出数组中最大元素的值和该数组元素的行值和列值。 3.所有关于数组的操作尽量使用指针 (FindMax)

文件列表:

FindMax.cpp,1315,2008-12-28
说明.txt,553,2010-10-12

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • optional-project-blackjact
    经典数据结构作业,黑杰克游戏。要求程序可以连续打10次,每场比赛的赢家,赢得一个点(两点一倍)。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )
    2012-12-08 11:46:33下载
    积分:1
  • KMP---MFC
    数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
    2020-07-04 08:40:01下载
    积分:1
  • ExchangeTree
    先序创建二叉树,将二叉树所有节点的左右子树交换,再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)
    2014-07-08 21:30:13下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • Project_ShortestPath
    任务:实现Dijkstra算法 工程名:Project_ShortestPath 要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
    2013-08-21 16:40:41下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • banker
    用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)
    2012-03-13 13:20:43下载
    积分:1
  • Bitree
    二叉树的打包数据结构,包括遍历,删除,添加,注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
    2015-10-04 23:44:33下载
    积分:1
  • POJ2371
    PKU ONLINEJUDGE 2371
    2011-10-21 15:03:03下载
    积分:1
  • @163
    数值计算方法中高斯主元素消元法 在vc环境中运行 用于解方程组(Numerical methods in the Gaussian elimination method, the main elements of the environment in vc run for the solution of equations)
    2011-10-19 20:28:39下载
    积分:1
  • 696516资源总数
  • 106637会员总数
  • 8今日下载