I'm working on a paper that uses ε-greedy algorithms for choosing episodes of a sarsa q-learning algorithms. I searched for algorithm but couldn't get so much. Can you please give me the algorithms and a little explanations about it?
ε-greedy is just a way to promote exploration in Reinforcement Learning. I would not classify SARSA or Q-Learning as ε-greedy algorithms.
The latter are very common reinforcement learning algorithms and you can definitely can find lots of material about them.
I would suggest to have a look at this classic book (the draft for the second edition is available for free)
Another shorter and excellent resource is (have a look at chapter 21):
Russell SJ, Norvig P, Davis E. Artificial intelligence: a modern approach. Upper Saddle River, NJ: Prentice Hall; 2010.
The paper you posted is using SARSA(λ), it is not the same as SARSA. You will need to go through a few Sutton chapters for that to make sense. You won't find it in Russell.
The link to SARSA(λ) in Sutton (1998) HTML version is here: webdocs.cs.ualberta.ca/~sutton/book/ebook/node77.html
However, I think you will need to read at least chapter 6 before jumping into eligibility traces