Skip to main content

Day 11: Statistics, Sorting, and Searching

Sorting

Selection sort

Homework

Cipher
Code in action


Code for Cipher.h

#ifndef _CIPHERH_
#define _CIPHERH_

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

char *getInput(void)
{
  int mem=16; 
  char *message=malloc(mem); //Preallocate memory
  printf("Input Message\n");
fgets(message,mem,stdin); //Take user input 

while(message[strlen(message)-1]!='\n') //Check if there's still space
{
mem*=2; 
message=realloc(message,mem); //Double amount of space
fgets(message + mem/2 - 1, mem/2 + 1, stdin); //Read the rest of the line
}
return message; //return character array message
}

int EncryptMessage(void)
{
  char *message=getInput(); //call getInput function
  int ch; //initialize variable ch
  
  int shift; //initialize variable shift
  
  printf("\nInput number of characters to shift: \n");
  scanf("%i",&shift); //ask user to choose shift for encryption
  
  char newarray[strlen(message)]; //initialize array that is the same length as the message to be encrypted
  
  for(int k=0; k<=strlen(message); k++)
  {
    ch=*(message+k); //set ch equal to the current value in the array
    if(ch>='a' && ch<='z')
    {
      ch=ch+shift; //encrypt letter
      if(ch>'z')
      {
        ch=ch-26; //if the value goes past z, subtract 26
      }
      if(ch<'a')
      {
        ch=ch+26; //if value goes past a, add 26;
      }
      newarray[k]=ch; //write new value into array
    }
    
    if(ch>='A' && ch<='Z')
    {
      ch=ch+shift;
      if(ch>'Z')
      {
        ch=ch-26;
      }
      if(ch<'A')
      {
        ch=ch+26;
      }
      newarray[k]=ch;
    }
    
    else
    {
      newarray[k]=ch; //ignore non-letters
      continue; //continue
    }
  }
  printf("Encrypted Message: \n %s\n",newarray); //print encrypted message
}

#endif

Code for main.c

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "cipher.h"

int main()
{
  EncryptMessage(); //Call message encryption function
  return 0;

}

Comments

Popular posts from this blog

Day 20: Structures, Programming with Pointers

Lecture Structures Structure defines set of data, but individual parts do not have to be the same type. Example 1.1 struct hurricane {  char name[10];  int year,category; }; Within a structure, variables and even arrays can be defined. Structures are also known as aggregate data types since multiple data values can be collected into a single data type. Individual values within a structure are called data members, and each member is given a name. In Example 1.1, the names of the data members are name, year, and category. To refer to a data member, the structure variable name followed by a period and a data member name is used.  Definition and Initialization Define structure. Keyword struct used to define name of structure (aka structure tag) and data members that are included in structure After structure defined, structure variables can be defined using declaration statements. Semicolon required after structure definition. Statements can appear before m...

Day 6: Analog Sensors | Functions and Modularity

Functions Functions are sets of statements that typically perform operation or compute value. They can help to make programs more accessible and usable for non-programmers e.g. create function that allows user to type "go forward" and move a robot forward. Modules -Functions can be split up into modules, "divide and conquer" -Each module has specific purpose, can be written and tested separately -Smaller than complete solution, therefore testing is easier -Can be used in new problem solutions without being retested -Reduces overall length of program -Allows for increased collaboration; modules can be worked on in parallel Debugging Longer Programs Use a compiler that gives meaningful information about errors. Adding comments around some sections of code can allow for better focus on other parts of the program. Test complicated functions by themselves. Programmer Defined Functions Execution of program always begins with main function. Additional ...

Day 7: Random Numbers and Recursion | Sound

Lecture Random Numbers Random numbers can be generated using the rand function, however, the same value would be printed since it generates integers in a specified sequence. To generate a new sequence of random numbers each time, a new random-number seed is needed. First, I need to use srand to generate a seed in order for the rand function to generate new random numbers every time. We can also generate random integers between specified limits.  #include <stdio.h> #include <stdlib.h> int main(void) {   /* Declare variables and function prototype. */   unsigned int seed;   int a, b, k;   int rand_int(int a,int b);   /* Get seed value and interval limits. */   printf("Enter a positive integer seed value: \n");   scanf("%u",&seed);   srand(seed);   printf("Enter integer limits a and b (a<b): \n");   scanf("%i %i",&a,&b);   /* Generate and print ten random numbe...