Task

$[30$ pts$.]$

Implement a program in Java that, given an array of $n$ integers, places all positive elements at the end of the array without changing the order of positive and negative elements with an $O(n)$ running time complexity.

a$.$ Example:

b$.$ Input: arr$[]=\{1,-1,3,2,-7,-5,11,6\}$

c$.$ Output: $-1-7-5132116$

Prove that your algorithm takes $(O(n))$ running time to compute this task. Formulate the sum equation for this proof.

Task$-3$:

$[35$ pts$.]$

You are given an $nm$ grid which contains lower case English letters. How many times does the phrase "saba" appear horizontally, vertically, and diagonally in the grid?

Input Format:

First line: Two integer $n$ and $m,$ where $n$ denotes $)n,m(100$ the number of rows and $m$ denotes the number of columns in the grid

Next $n$ lines: Each line must contain a string of length $m$ which contains lower$-$case English letters only

For Example:

A sample dialogue $($input$)$ is:

Enter $n$ value: $5$

Enter $m$ value: $5$

Enter $5$ lines of $5$ characters:

safer

amjad

babol

aaron

songs

This input will be stored in a $2$D array of $nm$