Sequential Search C++

#include<stdio.h>
#include<conio.h>
#include<math.h>

int array[100];
int cari,i, flag, a, e,pil,max,kel=1,titip,ok,ed;
float posisi;
void sequential();
main()
{

Sequential Search

#include<iostream.h>
#include <stdio.h>
#include <conio.h>
using namespace std;
int sequential_s(int array[],int size,int elemen);
int angka[10];
int main()
{
int size,a;
int data[99];

STACK

#include <stdio.h>
# include <stdlib.h>
using namespace std;
void push();
void pop();
void cetak ();
int x;
int s[99];
int t=-1,i,a,stack,menu;
char urut = 'Y';
int main (void)

Tutorial Binary Search C++

2. Binary Search
    Menu :
    1. Masukkan berapa banyak data
    2. Cari Data

Queue dengan Menu Bubble sort dan Insertion sort

1. Queue (Banyak Data ditentukan oleh User)
      Pilihan Data:
     
      1. Masukkan Data (Push)
      2. Keluarkan Data (POP)
      3. Print Data
  Apakah Data Mau diurutkan (Y/N) ?
Menu :
1. Buble sort
2. Insertion Sort

Insertion Sort

Coding Program Insertion Sort :

#include <iostream.h>
#include <conio.h>
int data[10], data2[10];
int n;
void tukar(int a, int b)
{
int t;
t=data[b];
data[b]=data[a];
data[a]=t;
}

semester2_Optional_BinaryTree

#include<iostream>

#include<cstdlib>

using namespace std;

class BinarySearchTree
void BinarySearchTree::insert(int d)