Change the way you’re doing the loop if you face a problem in reaching the first and/or the last character. If you want to compare each two adjacent characters then it’s better to start with a loop with counter = 0. It is not always about adding new items to the result objects, sometimes think […]
Category: Algorithms
Should we create our own trees to make searches on strings faster, or we can depend on database engine non-clustered indexes on char or Varchar fields to do so? The following facts will help us in deciding and understanding what is really happening in indexed char columns: You can make an indexed column of Varchar2 […]