Insertion Sorter in P Systems

In this study researchers pay attention to the essence of Insertion Sort and propose a sorter in Membrane Computing. This research shows how a theoretical computing device same as Membrane Computing can perform the basic concepts same as sorting. In this regard, researches introduce conditional reproduction rule such that each membrane can reproduce another membrane having same structure with the original membrane. The researchers use the functionality of comparator P system as a basis in which two multisets are compared and then stored in two adjacent membranes. And finally, the researchers present the process of sorting as a collection of transactions implemented in four levels while each level has different steps.