Machine Learning: Tips and Tricks, Cheatsheet. ⬇️
https://stanford.edu/~shervine/teaching/cs-229/cheatsheet-machine-learning-tips-and-tricks
❣️ Share & support us ❣️
➖ @geekcode ➖
https://stanford.edu/~shervine/teaching/cs-229/cheatsheet-machine-learning-tips-and-tricks
❣️ Share & support us ❣️
➖ @geekcode ➖
stanford.edu
CS 229 - Machine Learning Tips and Tricks Cheatsheet
Teaching page of Shervine Amidi, Graduate Student at Stanford University.
Personal details and documents for millions of Indians available in the deep web
https://securityaffairs.co/wordpress/103694/data-breach/indian-jobseekers-data-leak.html?utm_source=rss&utm_medium=rss&utm_campaign=indian-jobseekers-data-leak
https://securityaffairs.co/wordpress/103694/data-breach/indian-jobseekers-data-leak.html?utm_source=rss&utm_medium=rss&utm_campaign=indian-jobseekers-data-leak
Security Affairs
Personal details and documents for millions of Indians leaked online
Researchers have discovered a dump containing 29.1M Indian jobseekers personal details that is offered for free in the hacking underground.
BINARY SEARCH
C++
........
#include<iostream>
using namespace std;
int main()
{
int a[100], n, i, beg, end, mid, item;
cout << "Enter No. of Elements : ";
cin >> n;
cout << "\nEnter Elements in Sorted Order :\n";
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
cout << "\nEnter Item you want to Search : ";
cin >> item;
beg = 1;
end = n;
mid = (beg + end) / 2;
while (beg <= end && a[mid] != item)
{
if (a[mid] < item)
beg = mid + 1;
else
end = mid - 1;
mid = (beg + end) / 2;
}
if (a[mid] == item)
{
cout << "\nElement found at location : " << mid;
}
else
{
cout << "Element not found";
}
return 0;
}
========
Output
========
Enter No. of Elements : 3
Enter Elements in Sorted Order :
2
3
5
Enter Item you want to Search : 3
Element found at location : 2
C++
........
#include<iostream>
using namespace std;
int main()
{
int a[100], n, i, beg, end, mid, item;
cout << "Enter No. of Elements : ";
cin >> n;
cout << "\nEnter Elements in Sorted Order :\n";
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
cout << "\nEnter Item you want to Search : ";
cin >> item;
beg = 1;
end = n;
mid = (beg + end) / 2;
while (beg <= end && a[mid] != item)
{
if (a[mid] < item)
beg = mid + 1;
else
end = mid - 1;
mid = (beg + end) / 2;
}
if (a[mid] == item)
{
cout << "\nElement found at location : " << mid;
}
else
{
cout << "Element not found";
}
return 0;
}
========
Output
========
Enter No. of Elements : 3
Enter Elements in Sorted Order :
2
3
5
Enter Item you want to Search : 3
Element found at location : 2