Create an algorithm to identify whether two strings are anagrams.
Here is an example of an algorithm to identify whether two strings are anagrams:

1. Define a function called `is_anagram` that takes two string arguments, `str1` and `str2`.

2. If the lengths of `str1` and `str2` are not equal, return `False` since two strings must have the same length to be anagrams.

3. Create two dictionaries, `dict1` and `dict2`, to store the counts of characters in `str1` and `str2` respectively.

4. Loop through each character in `str1`, and for each character, increment its count in `dict1` by 1.

5. Do the same for `str2` and `dict2`.

6. If `dict1` and `dict2` are equal, return `True` to indicate that `str1` and `str2` are anagrams, otherwise return `False`.

The final algorithm in Python can look like this:

```python
def is_anagram(str1, str2):
    if len(str1) != len(str2):
        return False

    dict1 = {}
    dict2 = {}

    for char in str1:
        if char in dict1:
            dict1[char] += 1
        else:
            dict1[char] = 1

    for char in str2:
        if char in dict2:
            dict2[char] += 1
        else:
            dict2[char] = 1

    if dict1 == dict2:
        return True
    else:
        return False
```
Below is an instruction that describes a task, write a response that appropriately completes the request.

### Instruction:
Create an algorithm to identify whether two strings are anagrams.

### Response:
Here is an example of an algorithm to identify whether two strings are anagrams:

1. Define a function called `is_anagram` that takes two string arguments, `str1` and `str2`.

2. If the lengths of `str1` and `str2` are not equal, return `False` since two strings must have the same length to be anagrams.

3. Create two dictionaries, `dict1` and `dict2`, to store the counts of characters in `str1` and `str2` respectively.

4. Loop through each character in `str1`, and for each character, increment its count in `dict1` by 1.

5. Do the same for `str2` and `dict2`.

6. If `dict1` and `dict2` are equal, return `True` to indicate that `str1` and `str2` are anagrams, otherwise return `False`.

The final algorithm in Python can look like this:

```python
def is_anagram(str1, str2):
    if len(str1) != len(str2):
        return False

    dict1 = {}
    dict2 = {}

    for char in str1:
        if char in dict1:
            dict1[char] += 1
        else:
            dict1[char] = 1

    for char in str2:
        if char in dict2:
            dict2[char] += 1
        else:
            dict2[char] = 1

    if dict1 == dict2:
        return True
    else:
        return False
```