thinkphp

public class RecursiveBinarySearch {
	
        public static int RecursiveBinarySearch(int[] arr, int start, int end, int target) {

                if( start > end ) {
 
                      return -1;//target negasit
                } 

                int mid = start + (end - start) / 2;

thinkphp

public class IterativeBinarySearch {
	
        public static int IterativeBinarySearch(int[] arr, int target) {

               int start = 0;//limita inferioara

               int end = arr.length - 1;  //limita superioara


               while( start <= end ) {

thinkphp

#include <iostream>

using namespace std;


int binary_search0(int *arr, int lo, int hi, int key) {

       if(lo > hi) {
       	  return -1;
       }

thinkphp

#include <iostream>
#include <vector>

using namespace std;

int iterativeBinarySearch(const vector<int>&arr, int target) {

        int start = 0;

        int end = arr.size() - 1;  

thinkphp

#include <iostream>
#include <vector>

/*
T = 7
 9
 1 1 1 2 2 2 3 3 3
*/
using namespace std;

thinkphp

#include <iostream>
#include <vector>

using namespace std;

//programare dinamica
class Solution { 

public:	
vector<vector<int>> generate(int numRows) {

thinkphp

#include <iostream>
#include <vector>//template

//bubblesort, selection by minimum, insertion sort

//2 3 9 4 -1 23 4 54
//

using namespace std;

thinkphp

#include <iostream>

using namespace std;

class Solution {


        //n = 18
	   public:

thinkphp

#include <iostream>

using namespace std;

int main(int argc, char const *argv[])
{
	unsigned n;//input n natural

	cin>>n;

thinkphp

#include <stdio.h>

void fb() {

    int n;
    scanf("%d", &n);

    int arr[ n ];

    for(int i = 0; i < n; ++i) scanf("%d", &arr[i]);