Yes,
"in case of duplicates, always return first one or last one"
Type: Posts; User: cowa
Yes,
"in case of duplicates, always return first one or last one"
I have binary search - this one , but i need to change it like this , that it will search : for example we have array {1,10,11,12,15,16,22,22,22,22,30,40} I want to find 22 but not randomly - or it...
How can I do it - with pointer and only one loop ?
for exmpl function - unsigned int dif(const char *str)
counter = 0;
for(i = 0; i < N; i++)
A[i] = 0;
do
How can I print matrix with one loop . . .
void printMat(const int mat[][N], int n)
{
int i, j;
for(i = 0; i < n; i++)
{
Hi,
what i'm doing wrong ? I need to write recursive function that will change from lowercase letters to cap letters .
char big_let(char* str)
{
unsigned int i;
for ( i=0; i <...
What I'm doing wrong . . .
I need to count quantity of different digits in number
for example 321123 : and output i want like that
There r 3 different digits in the number 321123
...
thanx
It is possible to do it an another way ... ?
screenshot - MyPicx.com
Here is screenshot - the number reverse with "0"
printf("\nOriginal number: %d\n",n);
printf("Reverse number: ",rem);
while(n>0)
printf("\nOriginal number: %d\n",n);
printf("Reverse number: ");
while(n>0)
{
rem=n%10;
printf("%d", rem);
n=n/10;
}
Thank U very much!!!
Here the link of picture cmd
C - MyPicx.com
It's still doesn't work :(
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <conio.h>
void main()
{
unsigned int n,m,oddSum=0,evenSum=0;
char ch
printf("Please insert the number for the program:");...
Hello Everyone!
I want to count the sum of digits in odd places and in even places , and after that their difference
we know that first digit it's from the right side
How can I do it with...