Home/ Questions/Q 6964875
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T15:58:49+00:00

I have been trying to implement an efficient string comparing algorithm that will given

  • 0

I have been trying to implement an efficient string comparing algorithm that will given points according to character changes.

For example:

String #1: abcd  
String #2: acdb  
Initial Point: 0

In here String #2 character c changed it’s index from 2 to 1, and d changed its index from 4 to 3. Both of them (2-1=1 and 4-3=1) adds up to 2 points to initial point. Not a homework or anything, I just didn’t want to create a basic for loop comparing each character one by one and wanted to ask if anything efficient method (like hashing etc.) can be applied?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You are overcomplicating a simple thing. You can’t get more efficient than comparing each character and stopping the comparison at the first character you find different – which is basically what strcmp does. The only typical optimization you can do is, if you already know the length of the two strings (as happens when you use std::string or other counted strings), to determine them unequal immediately if the two length differ.

    • 0