prodhan

#include <iostream>

using namespace std;

int main()
{
       int LA[10]={4,20,8,2,7,6,3,48,62,75};
       int n=10, k=5, j, item=100;

   for (j = n - 1; j >= k - 1; j--)

prodhan

package bd.com.bahadur.bahadurmerchant;

import android.Manifest;
import android.content.Intent;
import android.content.pm.PackageManager;
import android.net.Uri;
import android.os.Build;
import android.support.v4.app.ActivityCompat;
import android.support.v4.content.ContextCompat;
import android.support.v7.app.AppCompatActivity;

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
problem no 22
EQN: x=cubic root (48)
Method: False Position
Note: Root lies between 3 and 4
*/

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
problem no 22
EQN: x=cubic root (48)
Method: Bisection
Note: Root lies between 3 and 4
*/

prodhan

/*
 * A c++ program to get the maximum total value in the knapsack
 * Created By Ariful Islam
 * Student of Dhaka International University
 * Batch of E-64
 */


#include<iostream>

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

/*
Created By Ariful Islam
Student of Dhaka Internationa University
Learn how does work this sort https://visualgo.net/en/sorting
*/


#include<iostream>

using namespace std;

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
    xmlns:app="http://schemas.android.com/apk/res-auto"
    xmlns:tools="http://schemas.android.com/tools"
    android:layout_width="match_parent"
    android:layout_height="match_parent"
    android:orientation="vertical"
    android:background="@drawable/bg"
    android:weightSum="10"
    tools:context=".MainActivity">