Horje
c code to algorithm converter online Code Example
c code to algorithm converter online 
#include<bits/stdc++.h>
using namespace std;
int main()
 int n,i,sum=0;
 cin>>n;
 int arr[n];
 for(i=0;i<n;i++)
 cin>>arr[i];
 sort(arr,arr+n);
 for(i=0;i<n;i++)
 {
 int z= arr[n-i-1]-(i+1);
 //cout<<z<<" ";
 //cout<<abs(z);
 sum=sum+abs(z);
 }
 cout<<sum;
 return 0;
 cout<<"swap(l,r);
}
c code to algorithm converter online 
/**
Name    : Md. Asaddozjaman
Id No   : 212902042
**/

#include <stdio.h>

int RecursiveLS(int arr[], int value, int index, int size)
{
    int pos = 0;

    if(index >=  size)
    {
        return 0;
    }
    else if (arr[index] == value)
    {
        pos = index + 1;
        return pos;
    }
    else
    {
        return RecursiveLS(arr, value, index+1,  size);
    }
    return pos;
}

int main()
{
    int size, value, pos, m = 0, arr[100];

    printf("\nEnter the size of array: ");
    scanf("%d", & size);

    for (int i = 0; i <  size; i++)
    {
        printf("\nEnter your elements: \n");
        scanf("%d", &arr[i]);
    }

    printf("Enter the element to search  ");
    scanf("%d", &value);

    pos =  RecursiveLS(arr, value, 0,  size);
    if (pos != 0)
    {
        printf("Element found: %d ", pos);
    }
    else
    {
        printf("Element not found...!");
    }
    return 0;
}
c code to algorithm converter online 
#include<stdio.h>
#define SIZE 5
void enQueue(int);
void deQueue();
void display();
int queue[10], front = -1, rear = -1;
void main() {
   int value, choice;
   while(1){
      printf("\n\n***** MENU *****\n");
      printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit");
      printf("\nEnter your choice: ");
      scanf("%d",&choice);
      switch(choice){
         case 1: printf("Enter the value to be insert: ");
                 scanf("%d",&value);
                 enQueue(value);
                 break;
         case 2: deQueue();
                 break;
         case 3: display();
                 break;
         case 4: exit(0);
         default: printf("\nWrong selection!!! Try again!!!");
      }
}}
void enQueue(int value){
   if(rear == SIZE-1)
      printf("\nQueue is Full!!! Insertion is not possible!!!");
   else{
      if(front == -1)
         front = 0;
      rear++;
      queue[rear] = value;
      printf("\nInsertion success!!!");
   }}
c code to algorithm converter online 
#include <stdio.h>

int main()
{
    char ch;
    printf("Enter any character: ");
    scanf("%c", &ch);
    if((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'))
    {
        printf("'%c' is alphabet.", ch);
    }
    else if(ch >= '0' && ch <= '9')
    {
        printf("'%c' is digit.", ch);
    }
    else 
    {
        printf("'%c' is special character.", ch);
    }
    return 0;
}



C

Related
Navigator.of(context).pop(); gives black screen instead of closing draer Code Example Navigator.of(context).pop(); gives black screen instead of closing draer Code Example
Sum of upper & lower triangles elements Code Example Sum of upper & lower triangles elements Code Example
c program for airthmetic operators Code Example c program for airthmetic operators Code Example
worst case Code Example worst case Code Example
terraform fargate cpu Code Example terraform fargate cpu Code Example

Type:
 Code Example
Category:
 Coding
Sub Category:
 Code Example
Uploaded by:
 Admin
Views:
 8



 

Horje