Suppose that we use a meta-heuristic algorithm to find the global optimal solution in a discrete space problem. Is the time complexity of meta-heuristic algorithms determined? As an example, in algorithms such as Genetic Algorithm, PSO and TLBO, how many percents of the total space is searched on average to get the answer? Is it possible to find the optimal point in a discrete problem whose number of solutions is 2^200?