Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Lab 9 v0.5
//gcc 5.4.0 #include <stdio.h> int main(void){ int n=4; int cu=0; int cut=0; int ci=0; int cit=0; char A[4]={'a','b','c','d'}; char B[4]={'c','d','e','f'}; //strlen(A); //strlen(B); char U[30]; char I[30]; for(int i=0;i<=n;i++){ for(int j=0;j<=n;j++){ if(A[i]==B[j]){ I[ci]=A[i]; ci++; printf("ci=%d I[%d]=%c\n",ci,ci,I[cu]); } } } for(int p=0;p<=n;p++){ U[p]=A[p]; cu++; } for(int o=0;o<=n;o++){ U[cu+o]=B[0] } cut=cu-1; //for(int l=0;l<=cut;l++) // printf("U[%d]=%c\n",l,I[l]); cit=ci-1; for(int k=0;k<=cit;k++) printf("I[%d]=%c\n",k,I[k]); }
run
|
edit
|
history
|
help
0
Arrays Grtade and Toppers
Lab 11v0.6
150109_RecursividadParImpar
Project 3 Part 1 v2.1
e
Class Friday 1/20 Inauguration Day
18BCE2182 ASSESS_1 Q2-2
C programming example that implements a modified string length function (from ECE 2534)
CONTADOR DE PALABRAS
tickeParsing.c