Abstarct: A celebrated result in quantum computation is the discovery of some quantum algorithms‎ able to solve problems faster than any known classical algorithm‎. ‎One of such algorithms is‎ ‎Grover’s search algorithm where a quadratic speedup over the best classical one is shown. ‎In Grover's algorithm‎, ‎we start with an initial n bit input state‎ and apply‎ to this state to generate superposition state. ‎In this thesis We firstly investigate the multipart entanglement features of the quantum states‎, ‎including the‎ iteration states achieved by repeated application of Grover iteration and the Oracle ones into‎ which the above iteration states evolve by applying single Oracle operation‎, ‎employed in Grover’s‎ search algorithm by means of the separable degree and the entanglement measure.Then we give‎ the quantitative and qualitative descxriptions of the entanglement dynamics in Grover’s search‎ algorithm‎.