Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
100 commits
Select commit Hold shift + click to select a range
fec7e33
Audny Correa
Audny738 Feb 14, 2020
82efe38
Merge pull request #5 from Audny738/master
Audny738 Feb 14, 2020
ad73de7
Ejercicio 7 y 13 en C
Feb 20, 2020
fcc6457
Pamela Canul
PamelaCanul Feb 20, 2020
8c6676f
Pamela Canul
PamelaCanul Feb 20, 2020
5ed35b1
Updating C Files
Feb 20, 2020
97e0def
Delete Ejercicio19.c
Feb 20, 2020
b0220a3
Delete Ejercicio1.c
Feb 20, 2020
6cda6c1
Audny Correa
Audny738 Feb 20, 2020
31a3490
Pamela Canul
PamelaCanul Feb 20, 2020
af8f71b
Merge pull request #6 from Audny738/master
Feb 20, 2020
cf5ccdc
Delete Ejercicio43.c
Feb 20, 2020
b16c264
Delete Ejercicio43.py
Feb 20, 2020
fbd7806
Delete Ejercicio48.c
Feb 20, 2020
710c316
Delete Ejercicio48.py
Feb 20, 2020
8ab9dfd
Add Ejercicio25.c
Apoquinto Feb 20, 2020
4c7a93d
Merge pull request #7 from Apoquinto/master
Feb 20, 2020
ccd0442
Added Ejercicios 6 y 12
Feb 22, 2020
6208a36
Merge pull request #8 from reyespublic/master
Feb 22, 2020
e5be418
Ejercicios 24 y 36
Feb 23, 2020
23dbb6e
Ejercicios 24 y 36 en C
Feb 24, 2020
b6e84db
Audny Correa
Audny738 Feb 24, 2020
d479013
Merge pull request #10 from MiguelRAvila/Audny738-patch-1
Audny738 Feb 24, 2020
571d191
Add cosos
Apoquinto Feb 24, 2020
1996565
Merge pull request #11 from Apoquinto/master
Feb 24, 2020
db15f14
Pamela Canul
PamelaCanul Feb 24, 2020
ea4ee66
Pamela Canul
PamelaCanul Feb 24, 2020
2a3fca7
Delete Ejercicio42.c
Feb 25, 2020
bffcbcf
Delete Ejercicio42.py
Feb 25, 2020
562e4cc
Add ADA 4 - Llanes
Mar 23, 2020
ef0e4eb
Merge pull request #12 from Apoquinto/master
Mar 23, 2020
8961a2a
Create Correa
Audny738 Mar 23, 2020
0b13a5d
Delete Correa
Mar 23, 2020
087eb3a
Create ADA4.c
Audny738 Mar 23, 2020
b7e251a
Create Canul
PamelaCanul Mar 24, 2020
26585f4
Delete Canul
PamelaCanul Mar 24, 2020
3b9443d
Create Canul
PamelaCanul Mar 24, 2020
6c37ff4
Delete Canul
PamelaCanul Mar 24, 2020
f9612e1
Create ADA4.c
PamelaCanul Mar 24, 2020
b97fec9
Added my part
Mar 24, 2020
8812fea
Merge pull request #13 from reyespublic/master
reyespublic Mar 24, 2020
1233190
Add Code
Mar 24, 2020
c813647
Merge pull request #14 from Apoquinto/master
Mar 24, 2020
2d762d6
Avila Ada
Mar 24, 2020
b25a7eb
Update ADA4.c
PamelaCanul Mar 25, 2020
7a9390b
Rename ADA4.c to ADA4_SinVisualizacion.c
PamelaCanul Mar 25, 2020
88c7c4d
Create ADA4_ConVisualizacion.c
PamelaCanul Mar 26, 2020
6032f5c
Fixed files
Mar 26, 2020
4cfdccc
Merge pull request #15 from reyespublic/master
reyespublic Mar 26, 2020
62c113e
Added Visual
Mar 26, 2020
b487e35
Merge pull request #16 from reyespublic/master
reyespublic Mar 26, 2020
47c4335
Merge pull request #1 from MiguelRAvila/master
reyespublic Mar 26, 2020
39c6c64
Added Ejercicio26
Mar 26, 2020
5b15522
Merge pull request #17 from reyespublic/master
Mar 26, 2020
7df83ec
MI Ada del 26 <3
Mar 26, 2020
b2c4eae
Create ADA4Visualizacion.c
Audny738 Mar 26, 2020
664002c
Merge remote-tracking branch 'origin/master'
Mar 26, 2020
70f5959
Create Ejercicio26Marzo.c
Audny738 Mar 26, 2020
fb8a033
< / 3
Mar 26, 2020
f8fb729
Merge branch 'master' of https://github.com/MiguelRAvila/Programacion…
Audny738 Mar 26, 2020
75ab0ea
Create Ejercicio26Marzo.c
PamelaCanul Mar 26, 2020
f6275ae
Add26Marzo
Mar 26, 2020
f2b850c
Merge pull request #18 from Apoquinto/master
Mar 26, 2020
23481dc
Add Ejercicio02Abril.c
Apr 2, 2020
e379f96
Merge pull request #19 from Apoquinto/master
Apr 2, 2020
f87228b
Added 02Abril
imreyesjorge Apr 2, 2020
7a5ac68
Merge pull request #20 from reyespublic/master
reyespublic Apr 2, 2020
b944cf3
Racionales
Audny738 Apr 3, 2020
5565699
Add Sudoku1.0
Apr 4, 2020
2b3ee6e
sudoku2
imreyesjorge Apr 5, 2020
1ac96e0
Fixed sudoku
imreyesjorge Apr 5, 2020
039bf3a
Merge pull request #21 from reyespublic/master
reyespublic Apr 5, 2020
7379bb9
Sudoku :o
Apr 5, 2020
e020aed
Sudoku 2 :0
Apr 5, 2020
8934a21
Sudoku Comment
Apr 5, 2020
df4366d
Delete error :c
Apr 5, 2020
865d199
Merge remote-tracking branch 'origin/master'
Apr 5, 2020
3ed1fc3
Avila Code
Apr 6, 2020
0c1bba6
Add sudoku con repetición
Apr 6, 2020
ce885bc
Create Ada6-Racionales.c
PamelaCanul Apr 7, 2020
2cf3da7
Merge pull request #22 from Apoquinto/master
Apr 7, 2020
4942307
Create ADA6-Sudoku.c
PamelaCanul Apr 9, 2020
b1684e6
Rename Sudoku.c to ADA6-Sudoku.c
Apr 9, 2020
69f6ef8
Rename Racionales.c to ADA6-Racionales.c
Apr 9, 2020
a9b4f72
Renombré los archivos
reyespublic Apr 16, 2020
d703d01
Merge pull request #23 from reyespublic/master
reyespublic Apr 16, 2020
2825e6a
Listas
reyespublic Apr 16, 2020
d8d010b
Merge pull request #24 from reyespublic/master
reyespublic Apr 16, 2020
6d7bda3
Create ADA6.-Sudoku.c
Audny738 Apr 17, 2020
ce31918
Create Ada6-Listas.c
Audny738 Apr 17, 2020
db8aef6
Add Ada6-Listas
Apr 27, 2020
0055047
Rename File :p
Apr 27, 2020
f33f1ca
Listas.c Renewed
Apr 27, 2020
e5a0769
Delete Ada6-Listas.c
Audny738 Apr 27, 2020
fdff6ed
Merge branch 'master' of https://github.com/MiguelRAvila/Programacion…
Audny738 Apr 27, 2020
bea8392
Listas
Audny738 Apr 27, 2020
2e936b9
Busqueda Binaria
Audny738 Apr 28, 2020
bc3cc64
Create ADA6-Listas.c
PamelaCanul May 4, 2020
119087b
Add list.c
Jun 15, 2020
0c51296
Merge pull request #25 from Apoquinto/master
Jun 15, 2020
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added ADAS/.DS_Store
Binary file not shown.
383 changes: 383 additions & 0 deletions ADAS/Canul/ADA4_ConVisualizacion.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,383 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 5


void asignarArreglo (int arr [][N]);
void imprimirArreglo (int arr [][N]);
void recorrerDiagonalPrincipal (int arr [][N]);
void recorrerDiagonalInvertida (int arr [][N]);
void recorrerMatriz12Ascendente (int arr [][N]);
void recorrerMatriz12Descendente (int arr [][N]);
void recorrerMatriz34Ascendente (int arr [][N]);
void recorrerMatriz34Descendente (int arr [][N]);
void recorrerMatriz14Ascendente (int arr [][N]);
void recorrerMatriz14Descendente (int arr [][N]);
void recorrerMatriz23Ascendente (int arr [][N]);
void recorrerMatriz23Descendente (int arr [][N]);
void recorrerMatriz1Ascendente (int arr [][N]);
void recorrerMatriz1Descendente (int arr [][N]);
void recorrerMatriz2Ascendente (int arr [][N]);
void recorrerMatriz2Descendente (int arr [][N]);
void recorrerMatriz3Ascendente (int arr [][N]);
void recorrerMatriz3Descendente (int arr [][N]);
void recorrerMatriz4Ascendente (int arr [][N]);
void recorrerMatriz4Descendente (int arr [][N]);

int main () {
int arreglo[N][N];
time_t t;
/* inicializacion del generador de numeros random*/
srand((unsigned) time(&t));

asignarArreglo(arreglo);
imprimirArreglo(arreglo);
recorrerDiagonalPrincipal(arreglo);
recorrerDiagonalInvertida(arreglo);
recorrerMatriz12Ascendente(arreglo);
recorrerMatriz12Descendente(arreglo);
recorrerMatriz34Ascendente(arreglo);
recorrerMatriz34Descendente(arreglo);
recorrerMatriz14Ascendente(arreglo);
recorrerMatriz14Descendente(arreglo);
recorrerMatriz23Ascendente(arreglo);
recorrerMatriz23Descendente(arreglo);
recorrerMatriz1Ascendente (arreglo);
recorrerMatriz1Descendente(arreglo);
recorrerMatriz2Ascendente (arreglo);
recorrerMatriz2Descendente(arreglo);
recorrerMatriz3Ascendente (arreglo);
recorrerMatriz3Descendente(arreglo);
recorrerMatriz4Ascendente (arreglo);
recorrerMatriz4Descendente (arreglo);

return(0);
}

/*asignar valores a la matriz*/
void asignarArreglo(int arr[][N]){
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++){
arr[i][j] = rand() % 10;
}
}
}

/*Imprimir la matriz */
void imprimirArreglo (int arr[][N]){
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
printf(" %d ", arr[i][j]);
}
printf("\n");
}
printf("\n");
}

/*Recorrer la diagonal principal */
void recorrerDiagonalPrincipal (int arr[][N]) {
printf("Diagonal Principal\n");
for(int i = 0; i<N; i++) {
for(int j=0; j<N; j++){
if(i==j){
printf(" %d ", arr[j][j]);
printf("\n");
}
else {
printf(" ");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la diagonal invertida*/
void recorrerDiagonalInvertida (int arr[][N]) {
printf("Diagonal Invertida\n");
for (int i=0; i<N; i++) {
for (int j=0; j<(N-i);j++){
if(j==(N-1-i)){
printf("%d",arr[i][j]);
printf("\n");
}
else {
printf(" ");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 1 y 2 de la matriz de forma ASCENDENTE*/
void recorrerMatriz12Ascendente (int arr[][N]){
printf("Region 1 y 2 Ascendente\n");
for (int i=0;i<N;i++){
for (int j=0; j<(N-i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 1 y 2 de la matriz de forma DESCENDENTE*/
void recorrerMatriz12Descendente (int arr [][N]) {
printf("Region 1 y 2 Descendente\n");
for (int i=N-1;i>=0;i--){
for (int j=0; j<(N-i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 3 y 4 de la matriz de forma ASCENDENTE*/
void recorrerMatriz34Ascendente (int arr [][N]){
printf("Region 3 y 4 Ascendente\n");
for(int i=0; i<N;i++) {
for(int j=0;j<N ;j++) {
if(j>=(N-1-i)){
printf("%d ", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 3 y 4 de la matriz de forma DESCENDENTE*/
void recorrerMatriz34Descendente (int arr [][N]){
printf("Region 3 y 4 Descendente\n");
for(int i=N-1; i>=0;i--) {
for(int j=N-1; j>=0 ;j--) {
if(j>=(N-1-i)) {
printf("%d ", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 1 y 4 de la matriz de forma ASCENDENTE*/
void recorrerMatriz14Ascendente (int arr [][N]){
printf("Region 1 y 4 Ascendente\n");
for(int i = 0; i < N; i++) {
for(int j = 0; j < (1+i); j++) {
printf("%d ", arr[i][j]);
printf("\t");
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 1 y 4 de la matriz de forma DESCENDENTE*/
void recorrerMatriz14Descendente (int arr [][N]){
printf("Region 1 y 4 Descendente\n");
for(int i = (N-1); i>=0; i--) {
for(int j =0; j<=i; j++) {
printf("%d ", arr[i][j]);
printf("\t");
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 2 y 3 de la matriz de forma ASCENDENTE*/
void recorrerMatriz23Ascendente (int arr [][N]) {
printf("Region 2 y 3 Ascendente\n");
for(int i = 0; i<N; i++) {
for(int j =0;j<N ; j++) {
if (j<=(N-1) && j>=i){
printf("%d ", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer las regiones 2 y 3 de la matriz de forma DESCENDENTE*/
void recorrerMatriz23Descendente (int arr [][N]){
printf("Region 2 y 3 Descendente\n");
for(int i = (N-1); i>=0; i--) {
for(int j =(N-1); j>=0; j--) {
if (j<=(N-1) && j>=i){
printf("%d ", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
}

/*Recorrer la region 1 de forma ASCENDENTE*/
void recorrerMatriz1Ascendente (int arr [][N]){
printf("Region 1 Ascendente\n");
/*Para imprimir la región se dividira en 2*/
for(int i=0; i<N; i++){
if(i<=N/2) {
for (int j=0;j<(1+i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
}
else {
for(int j=0;j<=(N-1-i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la region 1 de forma DESCENDENTE*/
void recorrerMatriz1Descendente (int arr [][N]){
printf("Region 1 Descendente\n");
for(int i=(N-1); i>=0; i--){
if(i<=N/2) {
for (int j=0;j<(1+i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
}
else {
for(int j=0;j<=(N-1-i);j++){
printf("%d ", arr[i][j]);
printf("\t");
}
}
printf("\n");
}
printf("\n");
}
/*Recorrer la region 2 de forma ASCENDENTE*/
void recorrerMatriz2Ascendente (int arr [][N]) {
printf("Region 2 Ascendente\n");
for(int i = 0; i<=N/2; i++) {
for(int j=0; j<N;j++){
if(j<N-i && j>=i) {
printf("%d ", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la region 2 de forma DESCENDENTE*/
void recorrerMatriz2Descendente (int arr [][N]) {
printf("Region 2 Descendente\n");
for(int i =N/2; i>=0; i--) {
for(int j=0; j<N;j++){
if(j<N-i && j>=i) {
printf("%d", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la region 3 de forma ASCENDENTE*/
void recorrerMatriz3Ascendente (int arr [][N]) {
printf("Region 3 Ascendente\n");
for(int i = 0; i <N; i++) {
for(int j=0;j<N;j++){
if(j>=i && j>=N-1-i && j>=(N-1)/2){
printf("%d", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la region 3 de forma DESCENDENTE*/
void recorrerMatriz3Descendente (int arr [][N]) {
printf("Region 3 Descendente\n");
for (int i=(N-1); i>=0;i--){
for(int j=0; j<N; j++){
if(j>=(N-1)/2 && j>=N-1-i && j>=i){
printf("%d", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
printf("\n");
}

/*Recorrer la region 4 de forma ASCENDENTE*/
void recorrerMatriz4Ascendente (int arr [][N]){
printf("Region 4 Ascendente\n");
for(int i =0; i < N; i++) {
for(int j=0; j<N;j++){
if (i>=(N-1)/2 && j>=N-1-i && j<=i){
printf("%d", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
}

/*Recorrer la region 4 de forma DESCENDENTE*/
void recorrerMatriz4Descendente (int arr [][N]) {
printf("Region 4 Descendente\n");
for(int i =(N-1); i>=0;i--){
for(int j=0;j<N;j++){
if(j<=i && i>=(N-1)/2 && j>=N-1-i) {
printf("%d", arr[i][j]);
printf("\t");
}
else {
printf("\t");
}
}
printf("\n");
}
}
Loading