it is an exercice and i can't do me pls.

0 votes
asked Apr 27 by gfrve dfss (340 points)
Enter a one-dimensional integer array. Find the largest odd item. Next, make a cyclic shift to the left of the elements standing to the right of the found maximum, and once shift the elements to the right, standing to the left of the found maximum.

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.
Welcome to OnlineGDB Q&A, where you can ask questions related to programming and OnlineGDB IDE and and receive answers from other members of the community.