Algorithms pseudocode; examples - Gabriel Istrate

← Back to document page

Step 1: sort the letters of the initial word Step 2: for each word in the dictionary having m letters: • Sort the letters of this word • Compare the sorted version of the word with the sorted version of the original word Rough estimate of the number of basic operations: – Sorting the initial word needs almost m2 operations (e.g. insertion ...

  Insertion, Sort, Pseudocode