Profit per kg (v/w)
6.0 |    E███████
5.0 |    A██████
3.0 |    C████
2.25|    F███
1.75|    D██
1.67|    B██
    +----------------→
     A  B  C  D  E  F

Capacity → 0   1   2   3   4   5   6   7   8   9   10
           ┌──────────────────────────────────────────┐
Step 1: E  █                                       | W=1 → Profit=6
Step 2: A  ███                                     | W=3 → Profit=16
Step 3: C  ████████                                | W=8 → Profit=31
Step 4: F  ██████████▏                             | W=10→ Profit=35.5
           └──────────────────────────────────────────┘

#include<stdio.h>

typedef struct {
    int value, weight;
    double ratio;
} Item;

void swap(Item* a, Item* b) {
    Item t = *a;
    *a = *b;
    *b = t;
}

double fractionalKnapsack(int W, Item items[], int n) {
    // Calculate ratio
    for(int i=0; i<n; i++)
        items[i].ratio = (double)items[i].value / items[i].weight;

    // Sort by ratio descending (Bubble sort for simplicity)
    for(int i=0; i<n-1; i++) {
        for(int j=0; j<n-i-1; j++) {
            if(items[j].ratio < items[j+1].ratio)
                swap(&items[j], &items[j+1]);
        }
    }

    double profit = 0;
    printf("Greedy Order (v/w): ");
    for(int i=0; i<n; i++) {
        if(W >= items[i].weight) {
            profit += items[i].value;
            W -= items[i].weight;
            printf("%d ", i+1);
        } else {
            double fraction = (double)W / items[i].weight;
            profit += fraction * items[i].value;
            printf("%d(%.2f) ", i+1, fraction);
            break;
        }
    }
    printf("\nMaximum Profit = %.2f\n", profit);
    return profit;
}

int main() {
    Item items[] = {{10,2}, {5,3}, {15,5}, {7,4}, {6,1}, {18,8}};
    int n = 6, W = 10;

    fractionalKnapsack(W, items, n);
    return 0;
}

Greedy Order (v/w): 5 1 3 6(0.25) 
Maximum Profit = 35.50