Given an array of integers, rearrange the array so that the left of the array is odd and the right is an even number. __ algorithm

Given an array of integers, rearrange the array so that the left of the array is odd and the right is an even number.

Requirements: Space complexity O (1), Time complexity of O (n).

Import java.util.ArrayList;
Import java.util.List;

public class Exchangeoddeven {public
	static void solution (List<integer> list) {
		if (null = = list) {
			return;
		}
		int = =; int Q=list.size ()-1;
		while (P<Q) {while
			(List.get (p)%2==1) {
				++p;
			}
			while (List.get (q)%2==0) {
				--q;
			}
			int Tmp=list.get (p);
			List.set (P, List.get (q));
			List.set (q, TMP);
		}
	public static void Main (string[] args) {
		list<integer> List = new arraylist<integer> ();
		List.add (1);
		List.add (4);
		List.add (7);
		List.add (a);
		Solution (list);
		SYSTEM.OUT.PRINTLN (list);
		
	}