Ağaçlar ile ilgili kod örneği aşağıdadır. #include<iostream> #include<conio.h> using namespace std; struct node { int data; node *left; node *right; }; void InsertNode(node *&, node *); void inorder(node *); void…

Quick Sort C++ Kod #include <iostream> using namespace std; void quickSort(int arr[], int lower, int upper){ int x = arr[(lower+upper)/2]; int i=lower, j = upper; do{ while(arr[i] < x) i++;…

Selection Sort C++ Kod #include <iostream> using namespace std; void selectionSort(int arr[], int n){ for(int i=0; i<n-1; i++){ int min = i; for(int j=i+1; j<n; j++){ if(arr[j]< arr[min]){ min =…

Insertion Sort C++ Kod #include <iostream> using namespace std; void insertionSort(int arr[], int n){ for(int i=0; i<n; i++){ int key = arr[i]; int j = i-1; while(j>=0 && arr[j]>key){ arr[j+1]…

Exchange Sort C++ Kod #include <iostream> using namespace std; void exchangeSort(int arr[], int n){ for(int i=0; i<n-1; i++){ for(int j=i+1; j<n; j++){ if(arr[i] > arr[j]){ int temp = arr[i]; arr[i]…

Bubble Sort C++ Kod #include <iostream> using namespace std; void bubbleSort(int arr[], int n){ for(int i=0; i<n-1; i++){ for(int j=0; j<n-1-i; j++){ if(arr[j] > arr[j+1]){ int temp = arr[j]; arr[j]…

Binary Search C++ Kod #include <iostream> using namespace std; void binarySearch(int arr[], int n, int key){ int lower=0, upper=n-1, pivot, isFind=0; while(lower<=upper){ pivot = (lower+upper)/2; if(key == arr[pivot]){ cout <<…

Linear Search C++ Kod #include <iostream> using namespace std; void linearSearch(int arr[], int n, int key){ int isFind=0; for(int i=0; i<n; i++){ if(arr[i] == key){ cout << i << “….