I have been going through sorting and searching algorithms and their implimentations in C language.

I found two terms Time complexity & Space complexity. But most of the sorting and searching algorithms speaks more about time complexity.

Those algorithms use lot of variables (space) and mentioning nothing about the space complexity.

Is space complexity NOT a factor to consider in sorting and searching algorithms???

What are your views??