In computer science, design analysis of algorithms is a very significant part. It is crucial to find the most efficient algorithm for solving a problem. There can be many algorithms to solve a problem, but the challenge here is to choose the most efficient one. There are multiple ways to design an algorithm, or taking into account which one to implement while solving critical applications in day to day life. When thinking about this, it is crucial to consider the algorithms time complexity and space complexity. This manuscript specifically examines the execution of reversing a vector using rev_vect() function with vect_slice(). Further comparing with the linear or sequential approach of reversing a vector with slicing methodology by calculating the time complexity of both the algorithms. In addition space complexity is also examined. The purpose is to provide efficient algorithm to reverse a vector.