Lexicographic Increasing Order

-
Lexicographic increasing order refers to arranging elements or objects in ascending order based on their lexicographic order. In lexicographic order, elements are compared character by character, and the order is determined by the alphabetical or numerical value of each character. For example, consider a list of strings: ["apple", "banana", "cherry", "apricot"]. When arranged in lexicographic increasing order, the list would be ["apricot", "apple", "banana", "cherry"]. The comparison starts with the first character of each string, and if the characters are equal, the comparison moves to the next character. In this case, "apricot" comes before "apple" because 'p' comes before 'p' and 'r' comes before 'p'. Similarly, "apple" comes before "banana" because 'a' comes before 'b'. The concept of lexicographic increasing order ...
Post a Comment

Java program to take two string as command line arguments and check that they are equal or not.

-
java program

 
/*

Do not use '==' operator for comparing strings in java. 
Because '==' checks if both objects point to the same memory address or location 
and .equals() compares values in the objects.

This program is made using library functions and without using library functions.

Here in this program I am using string library functions .equals() and .equalsIgnoreCase()
which gives output as boolean values true or false.

*/

import java.util.*;

public class str_cmp_cmd_line
{
    public static void main(String[] args)
    {

     System.out.println("First Input String ="+args[0]);
     //Commmand line arguments always starts from 0 i.e. args[0]
     System.out.println("Second Input String ="+args[1]);
    System.out.println("By using string library function of equals()");
    System.out.println("Input string1= "+args[0]+" & string2= "+args[1]+" are equal :"+args[0].equals(args[1]));
    // Here equals() checks each character with its order and also compares lowercase-uppercase letter
    System.out.println("By using string library function of equalsIgnoreCase()");
    //which ignores lower or uppercase of letters input and gives boolean value as true or false
    System.out.println("Input string1= "+args[0]+" & string2= "+args[1]+" are equal :             "+args[0].equalsIgnoreCase(args[1]));
    //Without using library functions
    int i,flag=1,len1,len2;
    len1=args[0].length();
    len2=args[1].length();
    char str1[] = args[0].toCharArray();
    char str2[] = args[1].toCharArray();
 
    if(len1==len2)
    { 
for(i=0;i<len1;i++)
{
     if(str1[i]!=str2[i])
    {
flag=0;
break;
    }
}
    }
    else
    {
flag=0; 
    } 
     if(flag==1)
    {
        System.out.println("The two string are EQUAL!!!");
System.out.println(args[0]+" = "+args[1]);
    }
    else
    {
        System.out.println("The two string are NOT EQUAL!!!");
        System.out.println(args[0]+" != "+args[1]);
    }
    }
}
/*

E:\java_prog>javac str_cmp_cmd_line.java

E:\java_prog>java str_cmp_cmd_line asd Asd

First Input String =asd
Second Input String =Asd
By using string library function of equals()
Input string1= asd & string2= Asd are equal : false
By using string library function of equalsIgnoreCase()
Input string1= asd & string2= Asd are equal : true
The two string are NOT EQUAL!!!
asd != Asd

E:\java_prog>java str_cmp_cmd_line asd asd

First Input String =asd
Second Input String =asd
By using string library function of equals()
Input string1= asd & string2= asd are equal : true
By using string library function of equalsIgnoreCase()
Input string1= asd & string2= asd are equal : true
The two string are EQUAL!!!
asd = asd

*/
// Java Programs | string Compare | String equal |
Location: Baramati, Maharashtra, India

Comments

Post a Comment

Please do not enter any spam links in the comment box.

Popular posts from this blog

Implement the following class hierarchy: Student: id, name, StudentExam (derived from Student): with n subjects (n can be variable) StudentResult (derived from StudentExam): with percentage, grade. Define a parameterized constructor for each class and appropriate functions to accept and display details. Create n objects of the StudentResult class and display the marklist using suitable manipulators.| CPP programs |

-
Image
  /* Cpp Manipulators used are endl and setw(). These manipulators require inclusion of header file <iomanip> endl : It is used for ending of line in an output. setw(): This manipulator sets the character spacing in an output i.e         for e.g. cout<<"Hello"<<setw(3)<<"World";         here setw(3) will set 3 character spacing between "Hello   World". */ #include<iostream> #include<iomanip> #include<string.h> using namespace std; class student { protected: int rno; char name[20]; public: student(int r,char name1[]) { rno=r; strcpy(name,name1); } void display() { cout<<"\n Student rno="<<rno; cout<<"\n Student name="<<name; } }; class student_exam:public student { protected: int *ptr; int no; public: student_exam(int r,char nm[],int n):student(r,nm) { no=n; ptr=new int[no]; } void...
Read more

Different Types of Computer Programming Languages

-
Image
Following are the different types of Computer Programming Languages:   1) Procedural languages :  These are used to execute a sequence of statements that lead to a result. They use multiple variables, heavy loops, and other elements.  Examples: BASIC, C, Fortran, Pascal, etc.  2) Functional languages :  These languages avoid loops in favor of recursive functions. The primary focus is on the return values of functions and side effects are discouraged.  Examples: Lisp, Python, Erlang, Haskell, Clourje, etc.  3) Object-Oriented languages :  These languages view the world as a group of objects that have internal data and external accessing parts of that data and offer services that can be used to solve problems.   Examples: Simula, Java, C++, Ruby, Python, etc.  4) Logic-Based languages :  These languages let programmers make declarative statements and then allow the machine to reason about the consequences of those statem...
Read more

Lexicographic Increasing Order

-
Lexicographic increasing order refers to arranging elements or objects in ascending order based on their lexicographic order. In lexicographic order, elements are compared character by character, and the order is determined by the alphabetical or numerical value of each character. For example, consider a list of strings: ["apple", "banana", "cherry", "apricot"]. When arranged in lexicographic increasing order, the list would be ["apricot", "apple", "banana", "cherry"]. The comparison starts with the first character of each string, and if the characters are equal, the comparison moves to the next character. In this case, "apricot" comes before "apple" because 'p' comes before 'p' and 'r' comes before 'p'. Similarly, "apple" comes before "banana" because 'a' comes before 'b'. The concept of lexicographic increasing order ...
Read more