Skip to main content

Switch ... Case-Basic Programming Concepts With Sudo Code

switch...case

it is used to execute the particular block of the code based on choice.

syntax

 switch([choice])
 {
 case 1://statement1 or block of program;
   break;
 case 2://statement1 or block of program;
   break;
 case 3://statement1 or block of program;
   break;
 }

example,

 main()
 {
 int a;
 a=3;
 switch(a)
 {
 case 1:printf("\n one");break;
 case 2:printf("\n two");break;
 case 3:printf("\n three");break;
 case 4:printf("\n four");break;
 default:printf("\n values is not equal to 1 to 4 numbers");
 }
 }
default default is a keyword used to execute the default block pf statements. which means if the switch case the value did not match any cases to execute the default statements. break break is a keyword used to exit control statements statements.
Labels:

Comments

Post a Comment

Popular posts from this blog

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)  ...
Post a Comment
Read more

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...
Post a Comment
Read more