Simple File Upload Using PHP

-
File Upload Using PHP <!DOCTYPE html>
<html>
<head>
<title>Upload your files</title>
</head>
<body>
<form enctype="multipart/form-data" action="upload.php" method="POST">
<p>Upload your file</p>
<input type="file" name="uploaded_file"></input><br />
<input type="submit" value="Upload"></input>
</form>
</body>
</html>
<?PHP
if(!empty($_FILES['uploaded_file']))
{
$path = "uploads/";
$path = $path . basename( $_FILES['uploaded_file']['name']);
if(move_uploaded_file($_FILES['uploaded_file']['tmp_name'], $path)) {
echo "The file ". basename( $_FILES['uploaded_file']['name']).
" has been uploaded";
} else{
echo "There was an error uploading the file, please try again!";
}
}
?>

Comments

Post a Comment

Popular posts from this blog

Maxheap Sort

-
Program In C:-                          //Maxheap Sort #include <stdio.h> #include <stdlib.h> #define MAX 20 void maxheapify(int *, int, int); int* buildmaxheap(int *, int); void main() {     int i, t, n; int *a = calloc(MAX, sizeof(int));     int *m = calloc(MAX, sizeof(int));     printf("enter no of elements in the array\n");     scanf("%d", &n);     printf("enter the array\n");     for (i = 0; i < n; i++) {         scanf("%d", &a[i]);     }     m = buildmaxheap(a, n);     printf("the heap is\n");     for (t = 0; t < n; t++) {         printf("%d\n", m[t]);     } } int* buildmaxheap(int a[], int n) {     int heapsize = n;     int j;     for (j = n/2; j >= 0; j--) {       ...
Read more

Quick Sort

-
Program In C++:-                          //Quick Sort #include<iostream> using namespace std; int a[25]; int Partition(int l,int h) {     int pivot,i,j;     pivot=a[l];     i=l;     j=h;     while(i<j)     {         while(a[i]<=pivot && i<=h)         {             i++;         }         while(a[j]>pivot && j>=l)         {             j--;         }         if(i<j)         {             int x=a[i];             a[i]=a[j];             a[j]=x;         }     }  ...
Read more

Merge Sort

-
Program In C++:-                          // Merge Sort #include<iostream> using namespace std; int a[20],b[20]; void Merge(int,int,int); void mergesort(int l,int h) {     if(l<h)     {         int mid=(l+h)/2;         mergesort(l,mid);         mergesort(mid+1,h);         Merge(l,mid,h);     } } void Merge(int l,int mid,int h) {     int i,j,k;     i=l;     j=mid+1;     k=l;     while(i<=mid && j<=h)     {         if(a[i]<=a[j])         {             b[k]=a[i];             i++;         }         else         {         ...
Read more