{"id":268,"date":"2012-04-28T14:24:52","date_gmt":"2012-04-28T21:24:52","guid":{"rendered":"http:\/\/www.gdjogos.com.br\/blog\/?p=268"},"modified":"2021-06-24T08:40:23","modified_gmt":"2021-06-24T11:40:23","slug":"exercicios-funcao-vetor-matriz","status":"publish","type":"post","link":"http:\/\/www.galirows.com.br\/meublog\/programacao\/exercicios-funcao-vetor-matriz\/","title":{"rendered":"Exerc\u00edcios com fun\u00e7\u00e3o para vetor e matriz"},"content":{"rendered":"\n<div>\n<div>Disponibilizo 3 exerc\u00edcios envolvendo fun\u00e7\u00e3o com vetores e matrizes. Disponibilizei c\u00f3digo-fonte com a solu\u00e7\u00e3o e v\u00eddeo explicativo das solu\u00e7\u00f5es.<\/div>\n<ol>\n<li>Criar fun\u00e7\u00e3o que recebe um vetor para verificar se ele est\u00e1 em ordem crescente ou decrescente.<\/li>\n<li>Criar uma fun\u00e7\u00e3o que verifica se determinado valor faz parte dos elementos do vetor.<\/li>\n<li>Criar uma fun\u00e7\u00e3o que mostra multiplica\u00e7\u00e3o de uma matriz por um determinado valor informado para a fun\u00e7\u00e3o.<\/li>\n<\/ol>\n<\/div>\n\n\n\n<!--more-->\n\n\n\n<div><strong>1- Criar fun\u00e7\u00e3o que recebe um vetor para verificar se ele est\u00e1 em ordem crescente ou decrescente<\/strong><\/div>\n\n\n\n<pre class=\"wp-block-code\"><code lang=\"c\" class=\"language-c\"><div>bool verificaOrdenacaoCrescente(int v[], int tam) {\n<pre class=\"brush:cpp\">    bool teste = true;\n\n    for (int i=1; i &lt; tam; i++) {\n        if (v[i-1] &gt; v[i]) {\n            teste = false;\n        }\n    }\n\n    return teste;\n}\n\nbool verificaOrdenacaoDescrescente(int v[], int tam) {\n    for (int i=1; i &lt; tam; i++) {\n        if (v[i-1] &lt; v[i]) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\nbool verificaOrdenacao(int v[], int tam) {\n    if (verificaOrdenacaoCrescente(v, tam) == true || verificaOrdenacaoDescrescente(v, tam) == true) {\n        return true;\n    } else {\n        return false;\n    }\n}\n\nint main()\n{\n    int vet[4] = {4 ,3, -1, 0};\n\n    if (verificaOrdenacao(vet, 4) == true ) {\n        cout &lt;&lt; \"Ordenado\";\n    } else {\n        cout &lt;&lt; \"N\u00e3o ordenado\";\n    }\n}<\/pre><\/div><\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/KUQ6xTYNTOI?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"480\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<hr>\n\n\n\n<div><strong>2- Criar uma fun\u00e7\u00e3o que verifica se determinado valor faz parte dos elementos do vetor<\/strong><\/div>\n\n\n\n<pre class=\"wp-block-code\"><code lang=\"c\" class=\"language-c\"><div>void preencheVetor(int v[], int tam) {\n<pre class=\"brush:cpp\">    srand(time(NULL));\n    for (int i = 0; i &lt; tam; i++) {\n        v[i] = rand()%10 + 100;   \/\/100....150\n    }\n}\n\nvoid mostraVetor(int v[], int tam) {\n    for (int i = 0; i &lt; tam; i++) {\n        cout&lt;&lt; \" | \" &lt;&lt; v[i] ;\n    }\n    cout &lt;&lt; \"|\" &lt;&lt; endl;\n}\n\nbool testa(int vet[], int tam, int x) {\n    for (int i = 0; i &lt; tam; i++) {\n        if (vet[i] == x) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\nint main()\n{\n    int vetor[100], num, tam;\n\n    cout &lt;&lt; \"Digite o tamanho do vetor: \";\n    cin &gt;&gt; tam;\n    cout &lt;&lt; \"Digite um n\u00famero: \";\n    cin &gt;&gt; num;\n\n    preencheVetor(vetor, tam);\n    mostraVetor(vetor, tam);\n\n    if (testa(vetor, tam, num) == true) {\n        cout &lt;&lt; \"Pertence!\";\n    } else {\n        cout &lt;&lt; \"N\u00e3o pertence!\";\n    }\n}<\/pre><\/div><\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><iframe loading=\"lazy\" src=\"\/\/www.youtube.com\/embed\/UdXwYTtOWQY?rel=0\" allowfullscreen=\"allowfullscreen\" width=\"640\" height=\"480\" frameborder=\"0\"><\/iframe><\/p>\n\n\n\n<hr>\n\n\n\n<div><strong>3- Criar uma fun\u00e7\u00e3o que mostra multiplica\u00e7\u00e3o de uma matriz por um determinado valor informado para a fun\u00e7\u00e3o<\/strong><\/div>\n\n\n\n<pre class=\"wp-block-code\"><code lang=\"c\" class=\"language-c\"><div>void mostraMatriz(float m[3][3]) {\n<pre class=\"brush:cpp\">    for (int i = 0; i &lt; 3; i++) {\n        for (int j = 0; j &lt; 3; j++) {\n            cout &lt;&lt; m[i][j];\n        }\n        cout&lt;&lt;\"n\";\n    }\n    cout&lt;&lt;\"nn\";\n}\n\nvoid multiplica(float mat[3][3], int fator, float mat2[3][3]) {\n    for (int i = 0; i &lt; 3; i++) {\n        for (int j = 0; j &lt; 3; j++) {\n            mat2[i][j] = mat[i][j] * fator;\n        }\n    }\n}\n\nint main()\n{\n    float mat[3][3] = {1, 2, 3,\n                        4, 5, 6,\n                        7, 8, 9.5};\n    float mat2[3][3];\n\n    multiplica(mat, 2, mat2);\n    mostraMatriz(mat);\n    mostraMatriz(mat2);\n}<\/pre><\/div><\/code><\/pre>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-4-3 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Exerc\u00edcio resolvido C++ (matriz e fun\u00e7\u00e3o)\" width=\"685\" height=\"514\" src=\"https:\/\/www.youtube.com\/embed\/aofop97d0CM?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Disponibilizo 3 exerc\u00edcios envolvendo fun\u00e7\u00e3o com vetores e matrizes. Disponibilizei c\u00f3digo-fonte com a solu\u00e7\u00e3o e v\u00eddeo explicativo das solu\u00e7\u00f5es. Criar fun\u00e7\u00e3o que recebe um vetor para verificar se ele est\u00e1 em ordem crescente ou decrescente. Criar uma fun\u00e7\u00e3o que verifica se determinado valor faz parte dos elementos do vetor. Criar uma fun\u00e7\u00e3o que mostra multiplica\u00e7\u00e3o [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[3,4],"tags":[13,8,14],"class_list":["post-268","post","type-post","status-publish","format-standard","hentry","category-c","category-videos","tag-matriz","tag-modularizacao-funcoes","tag-vetor"],"aioseo_notices":[],"amp_enabled":true,"_links":{"self":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/268","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/comments?post=268"}],"version-history":[{"count":5,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/268\/revisions"}],"predecessor-version":[{"id":1110,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/posts\/268\/revisions\/1110"}],"wp:attachment":[{"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/media?parent=268"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/categories?post=268"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.galirows.com.br\/meublog\/programacao\/wp-json\/wp\/v2\/tags?post=268"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}