Skip to main content

shell sort and radix sort 

  1. #include <stdio.h>
  2. void shellsort(int arr[], int num)
  3. {
  4.     int i, j, k, tmp;
  5.     for (i = num / 2; i > 0; i = i / 2)
  6.     {
  7.         for (j = i; j < num; j++)
  8.         {
  9.             for(k = j - i; k >= 0; k = k - i)
  10.             {
  11.                 if (arr[k+i] >= arr[k])
  12.                     break;
  13.                 else
  14.                 {
  15.                     tmp = arr[k];
  16.                     arr[k] = arr[k+i];
  17.                     arr[k+i] = tmp;
  18.                 }
  19.             }
  20.         }
  21.     }
  22. }

radix sort:


// C implementation of Radix Sort 

#include <stdio.h>

#include <stdlib.h>


int getMax(int arr[], int n) 
{ 
int mx = arr[0]; 
for (int i = 1; i < n; i++) 
if (arr[i] > mx) 
mx = arr[i]; 
return mx; 
} 

// A function to do counting sort of arr[] according to 
// the digit represented by exp. 
void countSort(int arr[], int n, int exp) 
{ 
int output[n]; // output array 
int i, count[10] = {0}; 

// Store count of occurrences in count[] 
for (i = 0; i < n; i++) 
count[ (arr[i]/exp)%10 ]++; 

// Change count[i] so that count[i] now contains actual 
// position of this digit in output[] 
for (i = 1; i < 10; i++) 
count[i] += count[i - 1]; 

// Build the output array 
for (i = n - 1; i >= 0; i--) 
{ 
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i]; 
count[ (arr[i]/exp)%10 ]--; 
} 

// Copy the output array to arr[], so that arr[] now 
// contains sorted numbers according to current digit 
for (i = 0; i < n; i++) 
arr[i] = output[i]; 
} 

// The main function to that sorts arr[] of size n using 
// Radix Sort 
void radixsort(int arr[], int n) 
{ 
// Find the maximum number to know number of digits 
int m = getMax(arr, n); 

// Do counting sort for every digit. Note that instead 
// of passing digit number, exp is passed. exp is 10^i 
// where i is current digit number 
for (int exp = 1; m/exp > 0; exp *= 10) 
countSort(arr, n, exp); 
} 

void print(int arr[], int n) 
{ 
for (int i = 0; i < n; i++) 
   printf("%d  ",arr[i]); 
} 

// Driver program to test above functions 
int main() 
{ 
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66}; 
int n = sizeof(arr)/sizeof(arr[0]); 
radixsort(arr, n); 
print(arr, n); 
return 0; 
} 

Labels:

Comments

Post a Comment

Popular posts from this blog

Mastering SQL for Data Science: Top SQL Interview Questions by Experience Level

Introduction: SQL (Structured Query Language) is a cornerstone of data manipulation and querying in data science. SQL technical rounds are designed to assess a candidate’s ability to work with databases, retrieve, and manipulate data efficiently. This guide provides a comprehensive list of SQL interview questions segmented by experience level—beginner, intermediate, and experienced. For each level, you'll find key questions designed to evaluate the candidate’s proficiency in SQL and their ability to solve data-related problems. The difficulty increases as the experience level rises, and the final section will guide you on how to prepare effectively for these rounds. Beginner (0-2 Years of Experience) At this stage, candidates are expected to know the basics of SQL, common commands, and elementary data manipulation. What is SQL? Explain its importance in data science. Hint: Think about querying, relational databases, and data manipulation. What is the difference between WHERE ...
Post a Comment
Read more

Spacy errors and their solutions

 Introduction: There are a bunch of errors in spacy, which never makes sense until you get to the depth of it. In this post, we will analyze the attribute error E046 and why it occurs. (1) AttributeError: [E046] Can't retrieve unregistered extension attribute 'tag_name'. Did you forget to call the set_extension method? Let's first understand what the error means on superficial level. There is a tag_name extension in your code. i.e. from a doc object, probably you are calling doc._.tag_name. But spacy suggests to you that probably you forgot to call the set_extension method. So what to do from here? The problem in hand is that your extension is not created where it should have been created. Now in general this means that your pipeline is incorrect at some level.  So how should you solve it? Look into the pipeline of your spacy language object. Chances are that the pipeline component which creates the extension is not included in the pipeline. To check the pipe eleme...
Post a Comment
Read more

20 Must-Know Math Puzzles for Data Science Interviews: Test Your Problem-Solving Skills

Introduction:   When preparing for a data science interview, brushing up on your coding and statistical knowledge is crucial—but math puzzles also play a significant role. Many interviewers use puzzles to assess how candidates approach complex problems, test their logical reasoning, and gauge their problem-solving efficiency. These puzzles are often designed to test not only your knowledge of math but also your ability to think critically and creatively. Here, we've compiled 20 challenging yet exciting math puzzles to help you prepare for data science interviews. We’ll walk you through each puzzle, followed by an explanation of the solution. 1. The Missing Dollar Puzzle Puzzle: Three friends check into a hotel room that costs $30. They each contribute $10. Later, the hotel realizes there was an error and the room actually costs $25. The hotel gives $5 back to the bellboy to return to the friends, but the bellboy, being dishonest, pockets $2 and gives $1 back to each friend. No...
Post a Comment
Read more